Resource restricted computability theoretic learning: Illustrative topics and problems
From MaRDI portal
Publication:733738
DOI10.1007/s00224-009-9169-7zbMath1187.68382OpenAlexW2036863956MaRDI QIDQ733738
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
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Elementary formal systems, intrinsic complexity, and procrastination
- From learning in the limit to stochastic finite learning
- When unlearning helps
- Non-U-shaped vacillatory and team learning
- Consistent and coherent learning with \(\delta \)-delay
- U-shaped, iterative, and iterative-with-counter learning
- Learning regular sets from queries and counterexamples
- Polynomial and abstract subrecursive classes
- Classical recursion theory. Vol. II
- On the role of procrastination in machine learning
- An average-case optimal one-variable pattern language learner
- Incremental learning from positive data
- Incremental concept learning for bounded data mining.
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Generality's price: Inescapable deficiencies in machine-learned programs
- Results on memory-limited U-shaped learning
- On characterizations of the basic feasible functionals, Part I
- Feasible Iteration of Feasible Learning Functionals
- Learning Efficiency of Very Simple Grammars from Positive Data
- Iterative Learning of Simple External Contextual Languages
- Dynamically Delayed Postdictive Completeness and Consistency in Learning
- A theory of the learnable
- On the complexity of inductive inference
- The Power of Vacillation in Language Learning
- Quantum Complexity Theory
- A new Characterization of Type-2 Feasibility
- Parsimony hierarchies for inductive inference
- On the Computational Complexity of Algorithms
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Computational speed-up by effective operators
- Language identification in the limit
- Recursive Structures and Ershov's Hierarchy
This page was built for publication: Resource restricted computability theoretic learning: Illustrative topics and problems
