Revision as of 13:14, 28 February 2007 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →Does S have to be a set of natural numbers?: yes ← Previous edit		Revision as of 17:04, 28 February 2007 edit undo Futonchild (talk \| contribs) 29 edits No edit summary Next edit →
Line 58: :The problem is that there is no definition of an r.e. set of teacups, because no computer has ever been seen to output a teacup. [[User:CMummert\|CMummert]] · <small>[[User talk:CMummert\|talk]]</small> 13:14, 28 February 2007 (UTC) :No computer has ever been seen to output a natural number, either. But the set of natural numbers is r.e. all the same. --[[User:Futonchild\|Futonchild]] 17:04, 28 February 2007 (UTC)

Talk:Computably enumerable set: Difference between revisions