Infinitary self-reference in learning theory

DOI10.1080/09528139408953778zbMath0803.68110OpenAlexW2024609530MaRDI QIDQ4290127

John Case

Publication date: 2 January 1995

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528139408953778

zbMATH Keywords

computational learning theoryprogram transformationKleene's second recursion theorem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (20)

A solution to Wiehagen's thesis ⋮ A map of update constraints in inductive inference ⋮ Parsimony hierarchies for inductive inference ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Spatial/kinematic domain and lattice computers ⋮ Computability-theoretic learning complexity ⋮ Iterative learning from positive data and counters ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Reflecting and self-confident inductive inference machines ⋮ Gold-Style Learning Theory ⋮ Parallelism Increases Iterative Learning Power ⋮ Dynamic Modeling in Inductive Inference ⋮ Program self-reference in constructive Scott subdomains ⋮ Synthesizing noise-tolerant language learners ⋮ Characterizing programming systems allowing program self-reference ⋮ Parallelism increases iterative learning power ⋮ Maximal machine learnable classes ⋮ Incremental concept learning for bounded data mining. ⋮ Towards a map for incremental learning in the limit from positive and negative information ⋮ Learning languages in the limit from positive information with finitely many memory changes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the error correcting power of pluralism in BC-type inductive inference
• Research in the theory of inductive inference by GDR mathematicians - A survey
• The independence of control structures in abstract programming systems
• On some games which are relevant to the theory of recursively enumerable sets
• Trade-off among parameters affecting inductive inference
• On degrees of unsolvability
• The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
• Gödel numberings of partial recursive functions
• Tradeoffs in the inductive inference of nearly minimal size programs
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• The Power of Pluralism for Automatic Program Synthesis
• Effectivizing Inseparability
• ON LEARNING LIMITING PROGRAMS
• Periodicity in generations of automata
• Program size in restricted programming languages
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Language identification in the limit

This page was built for publication: Infinitary self-reference in learning theory