On simple Goedel numberings and translations
In this paper we consider classes of Goedel numberings, viewed as simple models for programming languages, into which all other Goedel numberings can be translated by computationally simple mappings. Several such classes of Goedel numberings are defined and their properties are investigated. For example, one such class studied is the class of Goedel numberings into which all other Goedel numberings can be translated by finite automatic mappings. We also compare these classes of Goedel numberings to the class of optimal Goedel numberings and show that translation into optimal Goedel numberings can be computationally arbitrarily complex. Thus indicating that from a computer science point of view optimal Goedel numberings have undesirable properties.
Key wordsGoedel numberings translations complexity of translations optimal Goedel numberings
Unable to display preview. Download preview PDF.
- 1.Rogers, H. Jr., "Goedel Numberings of Partial Recursive Functions." J. of Symbolic Logic, Vol. 23, No. 3 (Sept. 1958) 331–341.Google Scholar
- 2.Rogers, H. Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Co., New York, 1967.Google Scholar
- 3.Constable, R.L., "The Operator Gap," IEEE Conference Record of 1969 Tenth Annual Symposium on Switching and Automata Theory, (1969) 20–26.Google Scholar
- 5.Schnorr, C.P., "Optimal Enumerations and Optimal Goedel Numberings" To appear in Math. Systm. Theory.Google Scholar
- 6.Hopcroft, J.E. and J.D. Ullman, Formal Languages and Their Relation to Automata. Addison-Wesley Publishing Co., Reading, Mass., 1969.Google Scholar