On the non-existence of maximal inference degrees for language identification
DOI10.1016/0020-0190(93)90229-3zbMATH Open0777.03013OpenAlexW1985133821WikidataQ127088229 ScholiaQ127088229MaRDI QIDQ685478FDOQ685478
Authors: Sanjay Jain, A. K. Sharma 
Publication date: 15 December 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90229-3
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- The Power of Vacillation in Language Learning
- Criteria of language learning
- Title not available (Why is that?)
- Language identification in the limit
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Inductive inference and unsolvability
- On the structure of degrees of inferability.
- Gödel numberings of partial recursive functions
- Title not available (Why is that?)
Cited In (11)
- The complexity of universal text-learners.
- Title not available (Why is that?)
- Learning power and language expressiveness.
- On the learnability of vector spaces
- Input-dependence in function-learning
- Learning by switching type of information.
- Results on memory-limited U-shaped learning
- The complexity of universal text-learners
- On the structure of degrees of inferability.
- Extremes in the degrees of inferability
- Characterizing language identification in terms of computable numberings
This page was built for publication: On the non-existence of maximal inference degrees for language identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685478)
