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

DOI10.1080/03081079008935117MaRDI QIDQ3495669zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexity measurescomputational complexityformal learning theoryGold's paradigminductioninductive inference

Mathematics Subject Classification ID

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

Recommendations

• PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
• scientific article; zbMATH DE number 3935022
• On the complexity of inductive inference
• Measuring static complexity
• scientific article; zbMATH DE number 3849208

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 3849208 (Why is no real title available?)
• PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
• scientific article; zbMATH DE number 3935022 (Why is no real title available?)
• The gap between abstract and concrete results in machine learning

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495669)