Content deleted Content added
No edit summary |
m Is this correct? |
||
Line 4:
No: All ordered pairs are tuples, but many tuples are not ordered pairs; some are ordered triples, etc. [[User:Michael Hardy|Michael Hardy]] 21:10, 12 Feb 2004 (UTC)
== Is this correct? ==
"There is an algorithm that, when given an input — typically an integer or a tuple of integers or a sequence of characters — eventually halts if it is a member of S and otherwise runs forever."
I've changed this sentence because all recursive sets are also recursively enumerable. Algorithms for RE sets are simply not guaranteed to halt if the input is not a member of the set. Also notice that the above sentence contradicts one of the examples.
| |||