On the learnability of vector spaces

DOI10.1016/j.jcss.2006.09.001zbMath1178.68297OpenAlexW2132014790MaRDI QIDQ859986

Frank Stephan, Valentina S. Harizanov

Publication date: 22 January 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.09.001

zbMATH Keywords

computational learning theoryinductive inferencerecursively enumerable vector spaces0-thin and 1-thin spaceslearning algebraic structures

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Learning Families of Closed Sets in Matroids ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Learning families of algebraic structures from informant ⋮ Calculating the mind change complexity of learning algebraic structures

Cites Work

• On the non-existence of maximal inference degrees for language identification
• Recursive properties of relations on models
• Learning regular sets from queries and counterexamples
• Recursion theory on fields and abstract dependence
• Inductive inference from all positive and some negative data
• Classical recursion theory. The theory of functions and sets of natural numbers
• A note on batch and incremental learnability
• Extremes in the degrees of inferability
• Learning by switching type of information.
• Refuting learning revisited.
• Language learning with some negative information
• Three theorems on the degrees of recursively enumerable sets
• Automorphisms of supermaximal subspaces
• Inductive inference and unsolvability
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• Recursively enumerable vector spaces
• Language identification in the limit
• Learning algebraic structures from text
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item