Inductive inference and computable numberings.
Klaus Ambos-SpiesSerikzhan A. BadaevSergey S. GoncharovPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- recursively enumerable
- inductive inference
- recursive functions
- languages from positive data
- kolmogorov complexity
- intrinsic complexity
- hypothesis spaces
- grammatical inference
- vc dimension
- real valued functions
- case based learning
- transductive inference
- learning from positive data
- pattern languages
- closed sets
- context free
- learning paradigms
- upper bound
- support vector
- mind change complexity
- algebraic structures
- domain knowledge