Robust separations in inductive inference

DOI10.2178/jsl/1305810752zbMath1221.03034OpenAlexW2051699541MaRDI QIDQ3011108

Mark A. Fulk

Publication date: 28 June 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1305810752

zbMATH Keywords

self-referenceinductive inferenceformal language learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Robust learning -- rich and poor ⋮ Robust learning of automatic classes of languages ⋮ Learning all subfunctions of a function ⋮ Computability-theoretic learning complexity ⋮ Synthesizing noise-tolerant language learners ⋮ Maximal machine learnable classes ⋮ Learning classes of approximations to non-recursive functions. ⋮ Robust behaviorally correct learning. ⋮ Avoiding coding tricks by hyperrobust learning

Cites Work

• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Prudence and other conditions on formal language learning
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Approximate inference and scientific method
• Robust learning aided by context
• Avoiding coding tricks by hyperrobust learning
• Robust behaviorally correct learning.
• Robust learning -- rich and poor
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Robust learning is rich