Skip to main content
Log in

Optimal enumerations and optimal gödel numberings

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. M. Blum, On the size of machines,Information and Control 11 (1967), 257–265.

    Google Scholar 

  2. A. N. Kolmogorov, Tri podhoda k opredeleniju ponjatija “količestvo informacii”,Problemy Peredači Informacii 11 (1965), 3–11.

    Google Scholar 

  3. H. Rogers, Gödel numberings of partial recursive functions,J. Symbolic Logic 23 (1958), 331–341.

    Google Scholar 

  4. H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    Google Scholar 

  5. R. J. Solomonoff, A formal theory of inductive inference I,Information and Control 7 (1964), 1–22.

    Google Scholar 

  6. R. M. Friedberg, Three theorems on recursive enumeration,J. Symbolic Logic 23 (1958), 309–313.

    Google Scholar 

  7. A. R. Meyer, Program size in restricted programming languages,Information and Control 21 (1972), 382–384.

    Google Scholar 

  8. C. P. Schnorr,Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, Springer-Verlag, Berlin-Heidelberg-New York, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schnorr, C.P. Optimal enumerations and optimal gödel numberings. Math. Systems Theory 8, 182–191 (1974). https://doi.org/10.1007/BF01762189

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762189

Keywords

Navigation