Rice and Rice-Shapiro Theorems for transfinite correction grammars
From MaRDI portal
Publication:3096086
DOI10.1002/malq.201020054zbMath1247.03093OpenAlexW2062284096MaRDI QIDQ3096086
Publication date: 7 November 2011
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201020054
Computational learning theory (68Q32) Recursive ordinals and ordinal notations (03F15) Hierarchies of computability and definability (03D55)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing oracle machines, online computing, and three displacements in computability theory
- Hierarchy of limiting computations
- On the role of procrastination in machine learning
- Generalized notions of mind change complexity
- Proof-theoretic analysis of termination proofs
- On a hierarchy of sets. III
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Dynamically Delayed Postdictive Completeness and Consistency in Learning
- Learning correction grammars
- Rice Theorems For D.R.E. Sets
- Rice Theorems for ∑n-1 Sets
- Parsimony hierarchies for inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Recursive Structures and Ershov's Hierarchy
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
