Generality's price: Inescapable deficiencies in machine-learned programs

DOI10.1016/j.apal.2005.06.013zbMath1088.68074OpenAlexW2127920721MaRDI QIDQ2368918

John Case, James S. Royer, Sanjay Jain, Keh-Jiann Chen, Wolfgang Merkle

Publication date: 28 April 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.06.013

zbMATH Keywords

Computational learning theoryApplications of computability theory

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Gold-Style Learning Theory ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• The recursion-theoretic structure of complexity classes
• Indexings of subrecursive classes
• A note on structure and looking back applied to the relative complexity of computable functions
• On the structure of sets in NP and other complexity classes
• A uniform approach to obtain diagonal sets in complexity classes
• Minimum-complexity pairing functions
• On the Structure of Polynomial Time Reducibility
• Computational Complexity of Probabilistic Turing Machines
• Toward a mathematical theory of inductive inference
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• Quantum Complexity Theory
• On the Computational Complexity of Algorithms
• Two-Tape Simulation of Multitape Turing Machines
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Costs of general purpose learning