Computability-theoretic learning complexity
From MaRDI portal
Publication:2941604
DOI10.1098/rsta.2011.0320zbMath1328.68099WikidataQ47604553 ScholiaQ47604553MaRDI QIDQ2941604
Publication date: 21 August 2015
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.2011.0320
self-referenceinductive inferencecomputability-theoretic learningepitomizing success criteriaminds and machinesreducibilities and completeness
68Q32: Computational learning theory
Related Items
Strongly non-U-shaped language learning results by general techniques, Intrinsic complexity of partial learning, Intrinsic Complexity of Partial Learning, The foundations of computation, physics and mentality: the Turing legacy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Consistent and coherent learning with \(\delta \)-delay
- Memory-limited non-U-shaped learning with solved open problems
- On the intrinsic complexity of learning
- Robust separations in inductive inference
- A Comparison of Five “Computable” Operators
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- Why Gödel didn't have church's thesis
- Inductive inference of formal languages from positive data
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- The Power of Vacillation in Language Learning
- Infinitary self-reference in learning theory
- The chemical basis of morphogenesis
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
