Revision as of 15:45, 10 August 2008 edit Wanderer57 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,886 edits →Dumb Questions: reply ← Previous edit		Revision as of 16:13, 10 August 2008 edit undo JRSpriggs (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 18,934 edits →Dumb Questions: finite sets are RE Next edit →
Line 128: ::::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)

Talk:Computably enumerable set: Difference between revisions