PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity

DOI10.1080/03081079008935116zbMath0711.68087OpenAlexW2147724699MaRDI QIDQ3495668

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

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Provability, truth, and modal logic
• Induction, pure and simple
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• A formal theory of inductive inference. Part I
• Language identification in the limit
• Formal Reductions of the General Combinatorial Decision Problem

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