Learning algebraic structures from text
From MaRDI portal
Publication:5958647
DOI10.1016/S0304-3975(00)00272-3zbMath0983.68156MaRDI QIDQ5958647
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
idealsArtinian ringsNoetherian ringsinductive inferencealgebraic structuresrecursion theorysynthesis of learners
Related Items (16)
Learning Families of Closed Sets in Matroids ⋮ On the learnability of vector spaces ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ Active Learning of Group-Structured Environments ⋮ Topological Properties of Concept Spaces ⋮ Learning families of algebraic structures from informant ⋮ Topological properties of concept spaces (full version) ⋮ Models of active learning in group-structured state spaces ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Learnability and positive equivalence relations ⋮ Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory ⋮ Random Subgroups of Rationals ⋮ Calculating the mind change complexity of learning algebraic structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Recursive digraphs, splinters and cylinders
- Synthesizing inductive expertise
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- On uniform learnability of language families
- Minimal models of theories of one function symbol
- Classical recursion theory. Vol. II
- On the role of procrastination in machine learning
- Noisy inference and oracles
- Ordinal mind change complexity of language identification
- Splinters of recursive functions
- Inductive inference of formal languages from positive data
- Inductive inference and unsolvability
- Rekursive Algebren mit Kettenbedingungen
- The number of countable models of a theory of one unary function
- Toward a mathematical theory of inductive inference
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The complexity of universal text-learners
- Language identification in the limit
- Complete theories of unars
- Robust learning with infinite additional information
This page was built for publication: Learning algebraic structures from text