Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.contributor.authorBaker, Theodore Paulen_US
dc.date.accessioned2007-04-19T19:03:51Z
dc.date.available2007-04-19T19:03:51Z
dc.date.issued1973-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-179en_US
dc.identifier.urihttps://hdl.handle.net/1813/6022
dc.description.abstractIn this paper we consider Goedel numberings (viewed as simple models for programming languages) into which all other Goedel numberings can be translated very easily. Several such classes of Goedel numberings are defined and their properties are investigated. We also compare these classes of Goedel numberings to optimal Goedel numberings and show that translation into optimal Goedel numberings can be computationally arbitrarily complex.en_US
dc.format.extent1260193 bytes
dc.format.extent371236 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn Simple Goedel Numberings and Translationsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics