Optimal enumerations and optimal gödel numberings
- 1 June 1974
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 8 (2) , 182-191
- https://doi.org/10.1007/bf01762189
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Program size in restricted programming languagesInformation and Control, 1972
- Zufälligkeit und WahrscheinlichkeitLecture Notes in Mathematics, 1971
- On the size of machinesInformation and Control, 1967
- A formal theory of inductive inference. Part IInformation and Control, 1964
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958