On the Amount of Nonconstructivity in Learning Recursive Functions
From MaRDI portal
Publication:3010414
DOI10.1007/978-3-642-20877-5_33zbMath1331.68120OpenAlexW2160698877MaRDI QIDQ3010414
Rūsiņš Freivalds, Thomas Zeugmann
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_33
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Turing machines that take advice
- Learning recursive functions: A survey
- On the structure of degrees of inferability.
- Minimal elements of \(\text{И}(H;p)\) and conjugacy of Levi complements in finite Chevalley groups.
- Amount of nonconstructivity in deterministic finite automata
- Automata that take advice
- Amount of Nonconstructivity in Finite Automata
- Inductive inference and unsolvability
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Limiting recursion
- Language identification in the limit
- Recursive Properties of Abstract Complexity Classes
- Ein Verfahren der mathematischen Logik
- Some remarks on the theory of graphs
This page was built for publication: On the Amount of Nonconstructivity in Learning Recursive Functions
