Resource restricted computability theoretic learning: Illustrative topics and problems
type: Item
instance of: scholarly article
title: Resource restricted computability theoretic learning: Illustrative topics and problems
zbMATH Open document ID: 1187.68382
author: John Case
published in: Theory of Computing Systems
publication date: 2009-10-19T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5617712
zbMATH Keywords: computability theoretic learning
zbMATH Keywords: fair polynomial time
zbMATH Keywords: memory limitations
zbMATH Keywords: optimality
MaRDI profile type: Publication
full work available at URL: s00224-009-9169-7
OpenAlex ID: W2036863956
cites work: Consistent and coherent learning with \(\delta \)-delay
cites work: Parsimony hierarchies for inductive inference
cites work: Learning regular sets from queries and counterexamples
cites work: Recursive Structures and Ershov's Hierarchy
cites work: When unlearning helps
cites work: Iterative Learning of Simple External Contextual Languages
cites work: Quantum Complexity Theory
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Results on memory-limited U-shaped learning
cites work: Non-U-shaped vacillatory and team learning
cites work: The Power of Vacillation in Language Learning
cites work: Q3447198
cites work: Dynamically Delayed Postdictive Completeness and Consistency in Learning
cites work: Q3704910
cites work: U-shaped, iterative, and iterative-with-counter learning
cites work: Comparison of identification criteria for machine inductive inference
cites work: Q4300060
cites work: Incremental concept learning for bounded data mining.
cites work: Generality's price: Inescapable deficiencies in machine-learned programs
cites work: Feasible Iteration of Feasible Learning Functionals
cites work: Introduction to algorithms
cites work: On the complexity of inductive inference
cites work: Q4393480
cites work: Q5619076
cites work: On the role of procrastination in machine learning
cites work: Language identification in the limit
cites work: On the Computational Complexity of Algorithms
cites work: Q3231529
cites work: Q3862379
cites work: On characterizations of the basic feasible functionals. I
cites work: Elementary formal systems, intrinsic complexity, and procrastination
cites work: A new Characterization of Type-2 Feasibility
cites work: Language learning from texts: Mindchanges, limited memory and monotonicity
cites work: Q5549798
cites work: Incremental learning from positive data
cites work: Polynomial and abstract subrecursive classes
cites work: Computational speed-up by effective operators
cites work: Classical recursion theory. Vol. II
cites work: An average-case optimal one-variable pattern language learner
cites work: Q5573961
cites work: Q4310702
cites work: A theory of the learnable
cites work: Q4115138
cites work: Learning Efficiency of Very Simple Grammars from Positive Data
cites work: From learning in the limit to stochastic finite learning
DOI: 10.1007/S00224-009-9169-7
description: scientific article; zbMATH DE number 5617712