Effectivity questions for Kleene's recursion theorem
From MaRDI portal
Publication:2636408
DOI10.1016/j.tcs.2018.04.036zbMath1393.68086OpenAlexW2799710542MaRDI QIDQ2636408
John Case, Frank Stephan, Sanjay Jain
Publication date: 5 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.036
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypothesis spaces for learning
- A connotational theory of program structure
- Comparison of identification criteria for machine inductive inference
- Characterizing language identification in terms of computable numberings
- Program self-reference in constructive Scott subdomains
- Index sets and universal numberings
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Numberings optimal for learning
- The independence of control structures in abstract programming systems
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- Characterizing language identification by standardizing operations
- Things that can be made into themselves
- Inductive inference and computable numberings
- Algorithmic Randomness and Complexity
- Effectivity Questions for Kleene’s Recursion Theorem
- Program Self-reference in Constructive Scott Subdomains
- Periodicity in generations of automata
- The Power of Vacillation in Language Learning
- Criteria of language learning
- An incomplete set of shortest descriptions
- Language identification in the limit
- On notation for ordinal numbers
- An introduction to Kolmogorov complexity and its applications
- Control structures in hypothesis spaces: The influence on learning
This page was built for publication: Effectivity questions for Kleene's recursion theorem
