Advanced Search
DSpace@MIT

A Basis for a Mathematical Theory of Computation

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author McCarthy, John en_US
dc.date.accessioned 2004-10-04T14:39:12Z
dc.date.available 2004-10-04T14:39:12Z
dc.date.issued 1962-01-01 en_US
dc.identifier.other AIM-031 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/6099
dc.description.abstract This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and computation has been added. Programs that learn to modify their own behaviors require a way of representing algorithms so that interesting properties and interesting transformations of algorithms are simply represented. Theories of computability have been based on Turing machines, recursive factions of integers and computer programs. Each of these has artificialities which make it difficult to manipulate algorithms or to prove things about them. The present paper presents a formalism based on conditional forms and recursive functions whereby the functions computable in terms of certain base functions can be simply expressed. We also describe some of the formal properties of conditional forms and a method called recursion induction for proving facts about algorithms. A final section in the relations between computation and mathematical logic is included. en_US
dc.format.extent 9914246 bytes
dc.format.extent 7740678 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries AIM-031 en_US
dc.title A Basis for a Mathematical Theory of Computation en_US


Files in this item

Name Size Format Description
AIM-031.ps 9.454Mb Postscript
AIM-031.pdf 7.382Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage