Guest
Text Details
|
To each computable sequence there corresponds at least one description number, while to no description number does there correspond more than one computable sequence. The computable sequences and numbers are therefore enumerable.
—
ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
(other)
by Turing
|
| Language: | English |
This text has been typed
14 times:
| Avg. speed: | 101 WPM |
|---|---|
| Avg. accuracy: | 97.6% |