Total complexity and the inference of best programs
- 1 December 1976
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 10 (1) , 181-191
- https://doi.org/10.1007/bf01683271
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Inductive inference: A recursion theoretic approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Some decidability results on grammatical inference and complexityInformation and Control, 1972
- An Overview of the Theory of Computational ComplexityJournal of the ACM, 1971
- On the Efficiency of AlgorithmsJournal of the ACM, 1970
- 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
- Limiting recursionThe Journal of Symbolic Logic, 1965
- Experiments with a Heuristic CompilerJournal of the ACM, 1963