Tradeoffs in the inductive inference of nearly minimal size programs
- 31 January 1982
- journal article
- Published by Elsevier in Information and Control
- Vol. 52 (1), 68-86
- https://doi.org/10.1016/s0019-9958(82)80086-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Pseudo-extensions of computable functionsInformation and Control, 1983
- Toward a mathematical theory of inductive inferenceInformation and Control, 1975
- Representative samples of programmable functionsInformation and Control, 1974
- Program size in restricted programming languagesInformation and Control, 1972
- On the size of machinesInformation and Control, 1967
- Language identification in the limitInformation and Control, 1967
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958