| dbp:reason
|
- The problem Gold investigated is not about learning a language, but about learning a language class. For example, it is trivial to learn an infinite language L from a class consisting of L only.) Gold's result meant here is probably that of his Theorem I.8 . The paragraph should be repharsed accordingly. (en)
- Gold introduces a methode called 'identification by enumeration' , but he didn't claim that each language 'defined by a Turing machine program can be learned' by that method, or by any other. Such a result would contradict the unlearnability result stated in the next section of this article. (en)
|
