Article PDF
Avoid common mistakes on your manuscript.
References
M. Blum, On the size of machines,Information and Control 11 (1967), 257–265.
A. N. Kolmogorov, Tri podhoda k opredeleniju ponjatija “količestvo informacii”,Problemy Peredači Informacii 11 (1965), 3–11.
H. Rogers, Gödel numberings of partial recursive functions,J. Symbolic Logic 23 (1958), 331–341.
H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
R. J. Solomonoff, A formal theory of inductive inference I,Information and Control 7 (1964), 1–22.
R. M. Friedberg, Three theorems on recursive enumeration,J. Symbolic Logic 23 (1958), 309–313.
A. R. Meyer, Program size in restricted programming languages,Information and Control 21 (1972), 382–384.
C. P. Schnorr,Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, Springer-Verlag, Berlin-Heidelberg-New York, 1971.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01762189