Guest
Text Details
|
A sequence is said to be computable if it can be computed by a circle-free machine. A number is computable if it differs by an integer from the number computed by a circle-free machine. We shall avoid confusion by speaking more often of computable sequences than of computable numbers.
—
ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
(other)
by Turing
|
| Language: | English |
This text has been typed
9 times:
| Avg. speed: | 77 WPM |
|---|---|
| Avg. accuracy: | 97.3% |