Revision as of 07:42, 23 March 2010 edit Trovatore (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,112 edits →Invalid definition of r.e. set: oh? ← Previous edit		Revision as of 17:52, 17 February 2018 edit undo Tsirel (talk \| contribs) Extended confirmed users 8,857 edits →Universal recursively enumerable set: new section Next edit →
Line 144: :[[Talk:Algorithm characterizations#can_an_algorithm_produce_infinite_output.3F]] of whether this is a legitimate use of the word "algorithm", which I thought had to produce at most finite output. [[Special:Contributions/66.127.52.47\|66.127.52.47]] ([[User talk:66.127.52.47\|talk]]) 21:20, 20 March 2010 (UTC) == Universal recursively enumerable set == Strangely, I do not see here a universal recursively enumerable set. [[User:Tsirel\|Boris Tsirelson]] ([[User talk:Tsirel\|talk]]) 17:52, 17 February 2018 (UTC)

Talk:Computably enumerable set: Difference between revisions