PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
DOI10.1080/03081079008935116zbMATH Open0711.68087OpenAlexW2147724699MaRDI QIDQ3495668FDOQ3495668
Authors: P. D. Turney
Publication date: 1990
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079008935116
Recommendations
computational complexitycomplexity measuresinductive inferenceinductionformal learning theoryGold's paradigm
Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- A formal theory of inductive inference. Part I
- Formal Reductions of the General Combinatorial Decision Problem
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- On the size of machines
- Title not available (Why is that?)
- Provability, truth, and modal logic
- Induction, pure and simple
Cited In (4)
This page was built for publication: PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495668)