Show simple item record

dc.contributor.authorMcCarthy, Johnen_US
dc.date.accessioned2004-10-04T14:39:12Z
dc.date.available2004-10-04T14:39:12Z
dc.date.issued1962-01-01en_US
dc.identifier.otherAIM-031en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6099
dc.description.abstractThis 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.extent9914246 bytes
dc.format.extent7740678 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-031en_US
dc.titleA Basis for a Mathematical Theory of Computationen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record