On the Non-Existence of Maximal Inference Degrees for Language Identification

Abstract Identification of grammars (r.e. indices) for recursively enumerable languages from positive data by algorithmic devices is a well-studied problem in learning theory. The present paper considers identification of r.e. languages by machines that have access to membership oracles for noncomputable sets. It is shown that for any set A there exists another set B such that the collections of r.e. languages that can be identified by machines with access to a membership oracle for B is strictly larger than the collections of r.e. languages that can be identified by machines with access to a membership oracle for A . In other words, there is no maximal inference degree for language identification.