Revision as of 19:05, 5 May 2005 edit 128.135.190.140 (talk) →Is this correct? ← Previous edit		Revision as of 18:36, 21 October 2005 edit undo 137.99.17.43 (talk) No edit summary Next edit →
Line 13: :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

Talk:Computably enumerable set: Difference between revisions