On the complexity of inductive inference
- 30 June 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 69 (1-3) , 12-40
- https://doi.org/10.1016/s0019-9958(86)80042-0
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983
- Comparison of identification criteria for machine inductive inferenceTheoretical Computer Science, 1983
- Research in the theory of inductive inference by GDR mathematicians—A surveyInformation Sciences, 1980
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- Relativization of the theory of computational complexityTransactions of the American Mathematical Society, 1976
- Toward a mathematical theory of inductive inferenceInformation and Control, 1975
- 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