Talk:Computably enumerable set: Difference between revisions

Revision as of 18:36, 21 October 2005

Revision as of 15:09, 3 January 2006

Line 14:

:P.S.If you post messages on talk pages please sign your message with <nowiki>~~~~</nowiki>.[[User:MathMartin|MathMartin]] 19:19, 5 Apr 2005 (UTC)

:Actually, Matiyasevich's Theorem says the converse: Every recursively enumerable set is Diophantine. Jim

:I can not agree with the wording "... eventually halts '''if and only if''' the input is an element of S ...". If it was so, recursive set could not be recursively enumerable, as the algurithm stops for input not being from S. I have changed the wording to "... eventually halts '''if''' the input is an element of S ...". This will allow recursive sets being also recursively enumerable. [[User:Zde|Zde]] 15:09, 3 January 2006 (UTC).

Actually, Matiyasevich's Theorem says the converse: Every recursively enumerable set is Diophantine. Jim