Recommendations
Cites work
- scientific article; zbMATH DE number 3833945 (Why is no real title available?)
- scientific article; zbMATH DE number 3878912 (Why is no real title available?)
- scientific article; zbMATH DE number 3914305 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3584924 (Why is no real title available?)
- scientific article; zbMATH DE number 1303202 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A note on batch and incremental learnability
- Automorphisms of supermaximal subspaces
- Classical recursion theory. The theory of functions and sets of natural numbers
- Extremes in the degrees of inferability
- Inductive inference and unsolvability
- Inductive inference from all positive and some negative data
- Language identification in the limit
- Language learning with some negative information
- Learning algebraic structures from text
- Learning by switching type of information.
- Learning regular sets from queries and counterexamples
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
- On the non-existence of maximal inference degrees for language identification
- Recursion theory on fields and abstract dependence
- Recursive properties of relations on models
- Recursively enumerable vector spaces
- Refuting learning revisited.
- Three theorems on the degrees of recursively enumerable sets
Cited in
(10)- Inductive inference systems for learning classes of algorithmically generated sets and structures
- scientific article; zbMATH DE number 1966620 (Why is no real title available?)
- Learning algebraic structures with the help of Borel equivalence relations
- Calculating the mind change complexity of learning algebraic structures
- PAC learning, VC dimension, and the arithmetic hierarchy
- On learning for families of algebraic structures
- On learning families of ideals in lattices and Boolean algebras
- Learning families of algebraic structures from informant
- Learning families of closed sets in matroids
- On learning down-sets in quasi-orders, and ideals in Boolean algebras
This page was built for publication: On the learnability of vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859986)