Hartmanis, JurisBaker, Theodore Paul2007-04-192007-04-191973-07http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-179https://hdl.handle.net/1813/6022In 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.1260193 bytes371236 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report