This is an old revision of this page, as edited by James086(talk | contribs) at 17:42, 29 December 2012(Wikiproject Computing assessment using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 17:42, 29 December 2012 by James086(talk | contribs)(Wikiproject Computing assessment using AWB)
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
This article is within the scope of WikiProject Robotics, a collaborative effort to improve the coverage of Robotics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.RoboticsWikipedia:WikiProject RoboticsTemplate:WikiProject RoboticsRobotics
I think this article erroneously states that "Gold showed that any language which is defined by a Turing machine program can be learned in the limit by another Turing-complete machine using enumeration." (Or it least this is extremely misleading.) Specifically, the only way that recursive (and recursively enumerable) languages are learnable in Gold's "Language Identification in the Limit" paper is if the learner is presented with text generated by a primitive recursive enumeration of the target language and the learner is only required to name the hypothesis language by a (recursively enumerable) generator.
Davidslv05:25, 11 December 2005 (UTC)Davidslv[reply]
.jpg?lang=en){kind=small}