Infinitary self-reference in learning theory
From MaRDI portal
(Redirected from Publication:4290127)
Recommendations
- Self-Sustaining Iterated Learning
- Recursion theoretic models of learning: Some results and intuitions
- scientific article; zbMATH DE number 2109239
- Learned infinite elements
- Self-reference and incompleteness in a non-monotonic setting
- Learning theory in the arithmetic hierarchy
- Learning, bounded memory, and inertia
- Theory and application of self-reference: logic and beyond
- A theory of the learnable
- Autonomous progression and transfinite iteration of self-applicable truth
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Comparison of identification criteria for machine inductive inference
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- Effectivizing Inseparability
- Gödel numberings of partial recursive functions
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3518262 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 1257634 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- Language identification in the limit
- Limiting recursion
- On degrees of unsolvability
- ON LEARNING LIMITING PROGRAMS
- On some games which are relevant to the theory of recursively enumerable sets
- On the error correcting power of pluralism in BC-type inductive inference
- On the size of machines
- Periodicity in generations of automata
- Program size in restricted programming languages
- Research in the theory of inductive inference by GDR mathematicians - A survey
- The independence of control structures in abstract programming systems
- The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
- The Power of Pluralism for Automatic Program Synthesis
- The Power of Vacillation in Language Learning
- Toward a mathematical theory of inductive inference
- Trade-off among parameters affecting inductive inference
- Tradeoffs in the inductive inference of nearly minimal size programs
- Trial and error predicates and the solution to a problem of Mostowski
Cited in
(25)- Parallelism increases iterative learning power
- Maximal machine learnable classes
- Incremental concept learning for bounded data mining.
- Learning secrets interactively. Dynamic modeling in inductive inference
- 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
- A solution to Wiehagen's thesis
- Computability-theoretic learning complexity
- Gold-style learning theory. A selection of highlights since Gold
- A map of update constraints in inductive inference
- Strongly non-U-shaped language learning results by general techniques
- Effectivity questions for Kleene's recursion theorem
- Parallelism Increases Iterative Learning Power
- Dynamic Modeling in Inductive Inference
- Infinitary simultaneous recursion theorem
- Kleene’s Amazing Second Recursion Theorem
- Iterative learning from positive data and counters
- Spatial/kinematic domain and lattice computers
- A Swiss pocket knife for computability
- Parsimony hierarchies for inductive inference
- Synthesizing noise-tolerant language learners
- Reflecting and self-confident inductive inference machines
- Program self-reference in constructive Scott subdomains
- Constructivity conditions on immune sets
- Characterizing programming systems allowing program self-reference
This page was built for publication: Infinitary self-reference in learning theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290127)
