The complexity of universal text-learners
From MaRDI portal
Publication:5055957
DOI10.1007/BFb0036205OpenAlexW2111196864MaRDI QIDQ5055957
Frank C. Stephan, Sebastiaan A. Terwijn
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0036205
Computational learning theory (68Q32) Formal languages and automata (68Q45) Other Turing degree structures (03D28)
Related Items (1)
Cites Work
- On the non-existence of maximal inference degrees for language identification
- Synthesizing inductive expertise
- Classical recursion theory. The theory of functions and sets of natural numbers
- Learning with the knowledge of an upper bound on program size
- Extremes in the degrees of inferability
- Inductive inference of formal languages from positive data
- A universal inductive inference machine
- Inductive inference and unsolvability
- Toward a mathematical theory of inductive inference
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of universal text-learners