Prescribed Learning of R.E. Classes
From MaRDI portal
Recommendations
Cites work
- Characterizations of monotonic and dual monotonic language learning
- Classical recursion theory. The theory of functions and sets of natural numbers
- scientific article; zbMATH DE number 1670875 (Why is no real title available?)
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- Increasing the power of uniform inductive learners
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning in Friedberg Numberings
- Monotonic and dual monotonic language learning
- Prudence and other conditions on formal language learning
- Prudence in vacillatory language identification
- Recursively enumerable sets of positive integers and their decision problems
- Separation of uniform learning classes.
- The Power of Vacillation in Language Learning
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Toward a mathematical theory of inductive inference
Cited in
(3)
This page was built for publication: Prescribed Learning of R.E. Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520050)