Revision as of 21:20, 20 March 2010 edit 66.127.52.47 (talk) No edit summary ← Previous edit		Revision as of 21:21, 20 March 2010 edit undo 66.127.52.47 (talk) →Dumb Questions Next edit →
Line 130: ::::Another question -- suppose a lookup table is created by picking a million numbers from a random number table, and an algorithm is created that halts only when given an input that is in the lookup table. Would that algorithm determine an r.e. set? [[User:Wanderer57\|Wanderer57]] ([[User talk:Wanderer57\|talk]]) 15:45, 10 August 2008 (UTC) :::::Yes. Every finite (or co-finite) set of natural numbers is recursively enumerable. Indeed, they are recursive. [[User:JRSpriggs\|JRSpriggs]] ([[User talk:JRSpriggs\|talk]]) 16:13, 10 August 2008 (UTC) =="Algorithm"== Article says:

Talk:Computably enumerable set: Difference between revisions