Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference.
Andris AmbainisJuris SmotrovsPublished in: AII/ALT (1994)
Keyphrases
- inductive inference
- recursive functions
- intrinsic complexity
- kolmogorov complexity
- languages from positive data
- grammatical inference
- algebraic structures
- vc dimension
- transductive inference
- context free
- learning paradigms
- case based learning
- classes of recursive functions
- mind change complexity
- learning from positive data
- hypothesis spaces
- closed sets
- pattern languages
- decision problems
- worst case
- support vector machine
- domain knowledge