Resource restricted computability theoretic learning: Illustrative topics and problems

DOI10.1007/S00224-009-9169-7MaRDI QIDQ733738zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimalitycomputability theoretic learningfair polynomial timememory limitations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

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

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 5899249 (Why is no real title available?)
• Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
• On the Complexity of Learning Minimum Time-Bounded Turing Machines

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)