On learning existentially definable subsets in a computable structure
From MaRDI portal
Cites work
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Classifications of definable subsets
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Computable Structure Theory
- Computable structures and the hyperarithmetical hierarchy
- Criteria of language learning
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- Language identification in the limit
- Learnability and positive equivalence relations
- Learning algebraic structures from text
- Learning families of algebraic structures from informant
- Learning families of algebraic structures from text
- Learning families of closed sets in matroids
- Learning indexed families of recursive languages from positive data: A survey
- Learning recursive functions: A survey
- Limit learning equivalence structures
- On ^0_1-classification of relations on computable structures
- On learning down-sets in quasi-orders, and ideals in Boolean algebras
- On the learnability of vector spaces
- Recursive isomorphism types of recursive Boolean algebras
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- The Power of Vacillation in Language Learning
- Topological properties of concept spaces (full version)
- Toward a mathematical theory of inductive inference
- Trial and error predicates and the solution to a problem of Mostowski
This page was built for publication: On learning existentially definable subsets in a computable structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897656)
