Separation of uniform learning classes.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833940 (Why is no real title available?)
- scientific article; zbMATH DE number 1804102 (Why is no real title available?)
- scientific article; zbMATH DE number 3702094 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 3555228 (Why is no real title available?)
- scientific article; zbMATH DE number 2080662 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Comparison of identification criteria for machine inductive inference
- How inductive inference strategies discover their errors
- Language identification in the limit
- On uniform learnability of language families
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Synthesizing inductive expertise
- The synthesis of language learners.
- Toward a mathematical theory of inductive inference
Cited in
(11)- scientific article; zbMATH DE number 2080660 (Why is no real title available?)
- scientific article; zbMATH DE number 2080662 (Why is no real title available?)
- Numberings optimal for learning
- scientific article; zbMATH DE number 1804102 (Why is no real title available?)
- Learning how to separate.
- Increasing the power of uniform inductive learners
- Prescribed learning of r.e. classes
- Topological separations in inductive inference
- Prescribed Learning of R.E. Classes
- Learning recursive functions: A survey
- Topological separations in inductive inference
This page was built for publication: Separation of uniform learning classes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426150)