Counting extensional differences in BC-learning
From MaRDI portal
Publication:1887167
DOI10.1016/S0890-5401(03)00174-3zbMath1078.68050OpenAlexW2002445120MaRDI QIDQ1887167
Frank Stephan, Sanjay Jain, Sebastiaan A. Terwijn
Publication date: 23 November 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00174-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- On the structure of degrees of inferability.
- Classical recursion theory. Vol. II
- On the role of procrastination in machine learning
- Ordinal mind change complexity of language identification
- Generalized notions of mind change complexity
- Complexity issues for vacillatory function identification
- Aggregating inductive expertise
- Inductive inference of formal languages from positive data
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Language identification in the limit
This page was built for publication: Counting extensional differences in BC-learning