Talk:Algorithmic learning theory
![]() | Computing Start‑class Low‑importance | |||||||||
|
![]() | Robotics Start‑class Mid‑importance | |||||||||
|
Untitled
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
External links modified
Hello fellow Wikipedians,
I have just added archive links to one external link on Algorithmic learning theory. Please take a moment to review my edit. If necessary, add {{cbignore}}
after the link to keep me from modifying it. Alternatively, you can add {{nobots|deny=InternetArchiveBot}}
to keep me off the page altogether. I made the following changes:
- Added archive http://web.archive.org/web/20120125223248/http://www.learningtheory.org:80/ to http://www.learningtheory.org/
When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).
An editor has reviewed this edit and fixed any errors that were found.
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
Cheers.—cyberbot IITalk to my owner:Online 08:36, 28 February 2016 (UTC)