Talk:Algorithmic learning theory

From Wikipedia, the free encyclopedia

	This article is within the scope of Computing WikiProject, an attempt to build a comprehensive and detailed guide to computers and computing. If you would like to participate, you can edit the article attached to this page, or visit the project page, where you can join the project and/or contribute to the discussion.
???	This article has not yet received a rating on the quality scale.
???	This article has not yet received an rating on the importance scale.

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. Davidslv 05:25, 11 December 2005 (UTC)Davidslv