Talk:Computably enumerable set: Difference between revisions

Revision as of 21:21, 20 March 2010

Revision as of 21:23, 20 March 2010

Line 136:

:* There is an algorithm that enumerates the members of S. That means that its output is simply a list of the members of S: s₁, s₂, s₃, ... . If necessary, this algorithm may run forever.

I have requested discussion at
:[[talkTalk:algorithmAlgorithm 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)