Resource restricted computability theoretic learning: Illustrative topics and problems

DOI10.1007/S00224-009-9169-7zbMATH Open1187.68382OpenAlexW2036863956MaRDI QIDQ733738FDOQ733738

Authors: John Case 

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9169-7

Recommendations

• Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
• scientific article
• scientific article; zbMATH DE number 1351087
• Memory limited inductive inference machines
• ON LEARNING LIMITING PROGRAMS

zbMATH Keywords

optimalitycomputability theoretic learningfair polynomial timememory limitations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• On the Computational Complexity of Algorithms
• U-shaped, iterative, and iterative-with-counter learning
• Learning regular sets from queries and counterexamples
• Incremental learning from positive data
• Results on memory-limited U-shaped learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Power of Vacillation in Language Learning
• Quantum Complexity Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language identification in the limit
• When unlearning helps
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of the learnable
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Classical recursion theory. Vol. II
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Title not available (Why is that?)
• Incremental concept learning for bounded data mining.
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Title not available (Why is that?)
• Comparison of identification criteria for machine inductive inference
• Non-U-shaped vacillatory and team learning
• An average-case optimal one-variable pattern language learner
• Recursive Structures and Ershov's Hierarchy
• On the complexity of inductive inference
• Title not available (Why is that?)
• On the role of procrastination in machine learning
• Feasible Iteration of Feasible Learning Functionals
• Elementary formal systems, intrinsic complexity, and procrastination
• Computational speed-up by effective operators
• Polynomial and abstract subrecursive classes
• On characterizations of the basic feasible functionals. I
• A new Characterization of Type-2 Feasibility
• Generality's price: Inescapable deficiencies in machine-learned programs
• Directions for computability theory beyond pure mathematical
• Learning Efficiency of Very Simple Grammars from Positive Data
• Iterative Learning of Simple External Contextual Languages
• Parsimony hierarchies for inductive inference
• From learning in the limit to stochastic finite learning
• Consistent and coherent learning with \(\delta \)-delay

Cited In (3)

• On the Complexity of Learning Minimum Time-Bounded Turing Machines
• Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
• Title not available (Why is that?)

This page was built for publication: Resource restricted computability theoretic learning: Illustrative topics and problems

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