Comparison of identification criteria for machine inductive inference
- 31 March 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 25 (2), 193-220
- https://doi.org/10.1016/0304-3975(83)90061-0
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (7903912, MCS-77, MCS-801072-8)
This publication has 18 references indexed in Scilit:
- Mechanism, Mentalism, and Metamathematics.The Philosophical Review, 1983
- Tradeoffs in the inductive inference of nearly minimal size programsInformation and Control, 1982
- Some natural properties of strong-identification in inductive inferenceTheoretical Computer Science, 1976
- Periodicity in generations of automataTheory of Computing Systems, 1974
- Some decidability results on grammatical inference and complexityInformation 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
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958