PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity

DOI10.1080/03081079008935117zbMath0711.68088OpenAlexW4249362961MaRDI QIDQ3495669

Peter 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/03081079008935117

zbMATH Keywords

computational complexityinductioninductive inferencecomplexity measuresformal learning theoryGold's paradigm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The gap between abstract and concrete results in machine learning

Cites Work

• COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
• Toward a mathematical theory of inductive inference
• Information-Theoretic Limitations of Formal Systems
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• The definition of random sequences
• A formal theory of inductive inference. Part I
• Language identification in the limit

This page was built for publication: PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity