Skip to content

Instantly share code, notes, and snippets.

@xen
Created November 27, 2020 19:57
Show Gist options
  • Save xen/51cb8c83f9299b892408f8db42fc44b5 to your computer and use it in GitHub Desktop.
Save xen/51cb8c83f9299b892408f8db42fc44b5 to your computer and use it in GitHub Desktop.
paper = open("turing_paper_1936.txt", "rt")
for line in paper:
print(line[:-1])
paper.close()
ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM
By A. M. TURING.
[Received 28 May, 1936.—Read 12 November, 1936.]
The "computable" numbers may be described briefly as the real numbers whose
expressions as a decimal are calculable by finite means. Although the subject
of this paper is ostensibly the computable numbers. it is almost equally easy
to define and investigate computable functions of an integral variable or a
real or computable variable, computable predicates, and so forth. The
fundamental problems involved are, however, the same in each case, and I have
chosen the computable numbers for explicit treatment as involving the least
cumbrous technique. I hope shortly to give an account of the relations of the
computable numbers, functions, and so forth to one another. This will include
a development of the theory of functions of a real variable expressed in terms
of com- putable numbers. According to my definition, a number is computable if
its decimal can be written down by a machine.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment