This action might not be possible to undo. Are you sure you want to continue?

**Three Displacements in Computability Theory
**

Robert I. Soare

∗

January 3, 2009

Contents

1 Introduction 4

1.1 Terminology: Incompleteness and Incomputability . . . . . . 4

1.2 The Goal of Incomputability not Computability . . . . . . . 5

1.3 Computing Relative to an Oracle or Database . . . . . . . . . 5

1.4 Continuous Functions and Calculus . . . . . . . . . . . . . . . 6

2 Origins of Computability and Incomputability 7

2.1 G¨odel’s Incompleteness Theorem . . . . . . . . . . . . . . . . 7

2.2 Alonzo Church . . . . . . . . . . . . . . . . . . . . . . . . . . 8

2.3 Herbrand-G¨odel Recursive Functions . . . . . . . . . . . . . . 9

2.4 Stalemate at Princeton Over Church’s Thesis . . . . . . . . . 10

2.5 G¨odel’s Thoughts on Church’s Thesis . . . . . . . . . . . . . . 11

3 Turing Breaks the Stalemate 11

3.1 Turing Machines and Turing’s Thesis . . . . . . . . . . . . . . 11

3.2 G¨odel’s Opinion of Turing’s Work . . . . . . . . . . . . . . . . 13

3.2.1 G¨odel [193?] Notes in Nachlass [1935] . . . . . . . . . 14

3.2.2 Princeton Bicentennial [1946] . . . . . . . . . . . . . . 15

∗

Parts of this paper were delivered in an address to the conference, Computation and

Logic in the Real World, at Siena, Italy, June 18–23, 2007. Keywords: Turing ma-

chine, automatic machine, a-machine, Turing oracle machine, o-machine, Alonzo Church,

Stephen C. Kleene, Alan Turing, Kurt G¨odel, Emil Post, computability, incomputability,

undecidability, Church-Turing Thesis, Post-Turing Thesis on relative computability, com-

putable approximations, Limit Lemma, eﬀectively continuous functions, computability in

analysis, strong reducibilities. Thanks are due to C.G. Jockusch, Jr., P. Cholak, and

T. Slaman for corrections and suggestions.

1

3.2.3 The Flaw in Church’s Thesis . . . . . . . . . . . . . . 16

3.2.4 G¨odel on Church’s Thesis . . . . . . . . . . . . . . . . 17

3.2.5 G¨odel’s Letter to Kreisel [1968] . . . . . . . . . . . . . 17

3.2.6 Gibbs Lecture [1951] . . . . . . . . . . . . . . . . . . . 17

3.2.7 Godel’s Postscriptum 3 June, 1964 to G¨odel [1934] . . 18

3.3 Hao Wang Reports on G¨odel . . . . . . . . . . . . . . . . . . 19

3.4 Kleene’s Remarks About Turing . . . . . . . . . . . . . . . . 19

3.5 Church’s Remarks About Turing . . . . . . . . . . . . . . . . 20

4 Oracle Machines and Relative Computability 20

4.1 Turing’s Oracle Machines . . . . . . . . . . . . . . . . . . . . 21

4.2 Modern Deﬁnitions of Oracle Machines . . . . . . . . . . . . . 21

4.2.1 The Graph of a Partial Computable Function . . . . . 23

4.2.2 The Graph of an Oracle Computable Functional . . . 23

4.3 The Oracle Graph Theorem . . . . . . . . . . . . . . . . . . . 23

4.4 Equivalent Deﬁnitions of Relative Computability . . . . . . . 24

4.4.1 Notation for Functions and Functionals . . . . . . . . 25

5 Emil Post Expands Turing’s Ideas 25

5.1 Post’s Work in the 1930’s . . . . . . . . . . . . . . . . . . . . 26

5.2 Post Steps Into Turing’s Place During 1940–1954 . . . . . . . 26

5.3 Post’s Problem on Incomplete C.E. Sets . . . . . . . . . . . . 28

5.4 Post Began With Strong Reducibilities . . . . . . . . . . . . . 28

6 Post Highlights Turing Computability 29

6.1 Post Articulates Turing Reducibility . . . . . . . . . . . . . . 29

6.2 The Post-Turing Thesis . . . . . . . . . . . . . . . . . . . . . 30

7 Continuous and Total Functionals 31

7.1 Representations of Open and Closed Sets . . . . . . . . . . . 31

7.2 Notation for Trees . . . . . . . . . . . . . . . . . . . . . . . . 31

7.3 Dense Open Subsets of Cantor Space . . . . . . . . . . . . . . 33

7.4 Eﬀectively Open and Closed Sets . . . . . . . . . . . . . . . . 33

7.5 Continuous Functions on Cantor Space . . . . . . . . . . . . . 34

7.6 Eﬀectively Continuous Functionals . . . . . . . . . . . . . . . 35

7.7 Continuous Functions are Relatively Computable . . . . . . . 36

8 Bounded Reducibilities 36

8.1 A Matrix M

x

for Bounded Reducibilities . . . . . . . . . . . . 36

8.2 Bounded Turing Reducibility . . . . . . . . . . . . . . . . . . 37

2

8.3 Truth-Table Reductions . . . . . . . . . . . . . . . . . . . . . 37

8.4 Diﬀerence of c.e. sets, n-c.e., and ω-c.e. sets . . . . . . . . . . 39

9 Online Computing 40

9.1 Turing Machines and Online Processes . . . . . . . . . . . . . 42

9.2 Trial and Error Computing . . . . . . . . . . . . . . . . . . . 42

9.3 The Limit Lemma . . . . . . . . . . . . . . . . . . . . . . . . 43

9.4 Two Models for Computing With Error . . . . . . . . . . . . 44

9.4.1 The Limit Computable Model . . . . . . . . . . . . . . 44

9.4.2 The Online Model . . . . . . . . . . . . . . . . . . . . 44

10 Three Displacements in Computability Theory 45

11 “Computable” versus “Recursive” 45

11.1 Church Defends Church’s Thesis with “Recursive” . . . . . . 46

11.2 Church and Kleene Deﬁne “Recursive” as “Computable” . . . 46

11.3 G¨odel Rejects “Recursive Function Theory” . . . . . . . . . . 47

11.4 The Ambiguity in the Term “Recursive” . . . . . . . . . . . . 48

11.5 Changing “Recursive” Back to “Inductive” . . . . . . . . . . 48

12 Renaming it the “Computability Thesis?” 50

12.1 Kleene Called it “Thesis I” in [1943] . . . . . . . . . . . . . . 50

12.2 Kleene Named it “Church’s thesis” in [1952] . . . . . . . . . . 50

12.3 Kleene Dropped “Thesis I” for “Church’s thesis” . . . . . . . 51

12.4 Evidence for the Computability Thesis . . . . . . . . . . . . . 51

12.5 Who First Demonstrated the Computability Thesis? . . . . . 52

12.6 The Computability Thesis and the Calculus . . . . . . . . . . 54

12.7 Founders of Computability and the Calculus . . . . . . . . . . 55

13 Turing a-machines versus o-machines? 57

13.1 Turing, Post, and Kleene on Relative Computability . . . . . 57

13.2 Relative Computability Uniﬁes Incomputability . . . . . . . . 57

13.3 The Key Concept of the Subject . . . . . . . . . . . . . . . . 57

13.4 When to Introduce Relative Computability . . . . . . . . . . 58

14 Conclusions 59

Abstract

We begin with the history of the discovery of computability in the

1930’s, the roles of G¨odel, Church, and Turing, and the formalisms of

recursive functions and Turing automatic machines (a-machines). To

3

whom did G¨odel credit the deﬁnition of a computable function? We

present Turing’s notion [1939, '4] of an oracle machine (o-machine)

and Post’s development of it in [1944, '11], [1948], and ﬁnally Kleene-

Post [1954] into its present form.

A number of topics arose from Turing functionals including con-

tinuous functionals on Cantor space and online computations. Almost

all the results in theoretical computability use relative reducibility and

o-machines rather than a-machines and most computing processes in

the real world are potentially online or interactive. Therefore, we argue

that Turing o-machines, relative computability, and online computing

are the most important concepts in the subject, more so than Turing

a-machines and standard computable functions since they are special

cases of the former and are presented ﬁrst only for pedagogical clar-

ity to beginning students. At the end in '10 – '13 we consider three

displacements in computability theory, and the historical reasons they

occurred. Several brief conclusions are drawn in '14.

1 Introduction

In this paper we consider the development of Turing oracle machines and

relative computability and its relation to continuity in analysis and to online

computing in the real world. We also challenge a number of traditional views

of these subjects as often presented in the literature since the 1930’s.

1.1 Terminology: Incompleteness and Incomputability

The two principal accomplishments in computability and logic in the 1930’s

were the discovery of incompleteness by G¨odel [1931] and of incomputabil-

ity independently by Church [1936] and Turing in [1936]. We use the term

“noncomputable” or “incomputable” for individual instances, but we of-

ten use the term “incomputability” for the general concept because it is

linguistically and mathematically parallel to “incomplete.” The term “in-

computable” appeared in English as early as 1606 with the meaning, that

which “cannot be computed or reckoned; incalculable,” according to the

Oxford English Dictionary. Websters dictionary deﬁnes it as “greater than

can be computed or enumerated; very great.” Neither dictionary lists an

entry for “noncomputable” although it has often been used in the subject to

mean “not computable” for a speciﬁc function or set analogously as “non-

measurable” is used in analysis.

4

1.2 The Goal of Incomputability not Computability

For several thousand years the study of algorithms had led to new the-

oretical algorithms and sometimes new devices for computability and cal-

culation. In the 1930’s for the ﬁrst time the goal was the refutation of

Hilbert’ two programs, a ﬁnite consistency proof for Peano arithmetic, and

the Entscheidungsproblem (decision problem). For the latter, two main dis-

coverers of computability, Alonzo Church and Alan Turing, wanted to give

formal deﬁnitions of a computable function so that they could diagonalize

over all computable functions and produce an incomputable (unsolvable)

problem. The speciﬁc models of computable functions produced by 1936,

Turing a-machines, λ-deﬁnable functions, and recursive functions, would

all have deep applications to the design and programming of computing

machines, but not until after 1940. Meanwhile, the researchers spent the re-

mainder of the 1930’s investigating more of the new world of incomputability

they had created by diagonal arguments, just as Georg Cantor had spent the

last quarter of the nineteenth century exploring the world of uncountable

sets which he had created by the diagonal method. In '1 and '2 we consider

this historical development from 1931 to 1939 and we introduce quotes from

G¨odel to show convincingly that he believed “the correct deﬁnition of me-

chanical computability was established beyond any doubt by Turing” and

only by Turing.

1.3 Computing Relative to an Oracle or Database

In 1936 Turing’s a-machines and Church’s use of G¨odel’s recursive functions

solved an immediate problem by producing a deﬁnition of a computable

function, with which one could diagonalize and produce undecidable prob-

lems in mathematics. The Turing a-machine is a good model for oﬄine

computing such as a calculator or batch processor where the process is ini-

tially given a procedure and an input and continues with no further outside

information.

However, many modern computer processes are online processes in that

they consult an external data base of other resource during the computation

process. For example, a laptop computer might consult the World Wide Web

via an ethernet or wireless connection while it is computing. These processes

are sometimes called online or interactive or database processes depending

on the way they are set up.

Turing spent 1936–1938 at Princeton writing a Ph.D. thesis under Church

on ordinal logics. A tiny and obscure part of his paper [1939, '4] included

5

a description of an oracle machine (o-machine) roughly a Turing a-machine

which could interrogate an “oracle” (external database) during the computa-

tion. The one page description was very sketchy and Turing never developed

it further.

Emil Post [1944, '11] considerably expanded and developed relative com-

putability and Turing functionals. These concepts were not well understood

when Post began, but in Post [1943], [1944], [1948] and Kleene-Post [1954]

they emerged into their modern state. These are summarized in the Post-

Turing Thesis of '6.2. This remarkable role by Post has been underempha-

sized in the literature but is discussed here in '5 and '6.

The theory of relative computability developed by Turing and Post and

the o-machines provide a precise mathematical framework for database or

online computing just Turing a-machines provide one for oﬄine computing

processes such as batch processing. Oracle computing processes are those

most often used in theoretical research and also in real world computing

where a laptop computer may communicate with a database like the World

Wide Web. Often the local computer is called the “client” and the remote

device the “server.”

In '4–'6 we study Turing’s oracle machines (o-machines) and Post’s de-

velopment of them into relative computability. It is surprising that so much

attention has been paid to the Church-Turing Thesis 3.2 over the last sev-

enty years and so little to the Post-Turing Thesis 6.1 on relative reducibil-

ity, particularly in view of the importance of relative computability (Turing

o-machines) in comparison with plain computability (Turing a-machines) in

both theoretical and practical areas.

1.4 Continuous Functions and Calculus

In '7 we show that any Turing functional on Cantor space 2

ω

is an eﬀec-

tively continuous partial map. Conversely, for any continuous functional

there is a Turing functional relative to some real parameter which deﬁnes it,

thereby linking computability with analysis. This makes Turing functionals

the analogue in computability of the continuous functions in analysis as we

explain. In contrast, Turing a-machines viewed as functionals on Cantor

space produce only a constant functional. Surprisingly, there appears to

be more emphasis in calculus books on continuous functionals than there is

in introductory computability books on computably continuous functionals

and relative computability.

6

2 Origins of Computability and Incomputability

Mathematicians have studied algorithms and computation since ancient

times, but the modern study of computability and incomputability be-

gan around 1900. David Hilbert was deeply interested in the foundations

of mathematics. Hilbert [1899] gave an axiomatization of geometry and

showed [1900] that the question of the consistency of geometry reduced

to that for the real-number system, and that in turn, to arithmetic by

results of Dedekind (at least in a second order system). Hilbert [1904]

proposed proving the consistency of arithmetic by what emerged [1928]

as his ﬁnitist program. He proposed using the ﬁniteness of mathematical

proofs in order to establish that contradictions could not be derived. This

tended to reduce proofs to manipulation of ﬁnite strings of symbols de-

void of intuitive meaning which stimulated the development of mechanical

processes to accomplish this. Hilbert’s second major program concerned

the Entscheidungsproblem (decision problem). Kleene [1987b, p. 46] wrote,

“The Entscheidungsproblem for various formal systems had been posed by

Schr¨oder [1895], L¨owenheim [1915], and Hilbert [1918].” The decision prob-

lem for ﬁrst order logic emerged in the early 1920’s in lectures by Hilbert and

was stated in Hilbert and Ackermann [1928]. It was to give a decision proce-

dure (Entscheidungsverfahren) “that allows one to decide the validity of the

sentence.” Hilbert characterized this as the fundamental problem of mathe-

matical logic. Davis [1965, p. 108] wrote, “This was because it seemed clear

to Hilbert that with the solution of this problem, the Entscheidungsproblem,

it should be possible, at least in principle, to settle all mathematical ques-

tions in a purely mechanical manner.” Von Neumann (1927) doubted that

such a procedure existed but had no idea how to prove it.

2.1 G¨ odel’s Incompleteness Theorem

Hilbert retired in 1930 and was asked to give a special address in the fall of

1930 in K¨onigsberg, the city of his birth. Hilbert spoke on natural science

and logic, the importance of mathematics in science, and the importance

of logic in mathematics. He asserted that there are no unsolvable problems

and stressed,

Wir m¨ ussen wissen. (We must know.)

Wir werden wissen. (We will know.)

At a mathematical conference preceding Hilbert’s address, a quiet, obscure

young man, Kurt G¨odel, only a year a beyond his Ph.D., announced a result

7

which would forever change the foundations of mathematics. He formalized

the liar paradox, “This statement is false,” to prove roughly that for any

eﬀectively axiomatized, consistent extension T of number theory (Peano

arithmetic) there is a sentence σ which asserts its own unprovability in T.

John von Neumann in the audience immediately understood the importance

of G¨odel’s Incompleteness Theorem. He was at the conference representing

Hilbert’s proof theory program, and recognized that Hilbert’s program was

over. In the next few weeks von Neuman realized that by arithmetizing

the proof of G¨odel’s ﬁrst theorem, one could prove an even better one, that

no such formal system T could prove its own consistency. A few weeks

later he brought his proof to G¨odel who thanked him and informed him

politely that he had already submitted the Second Incompleteness Theorem

for publication. G¨odel’s Incompleteness Theorem [1931] not only refuted

Hilbert’s program on proving consistency, but it also had a profound ef-

fect on refuting Hilbert’s second theme of the Entscheidungsproblem. G¨odel

had successfully challenged the Hilbert’s ﬁrst proposal. This made it eas-

ier to challenge Hilbert on the second topic of the decision problem. Both

refutations used diagonal arguments. Of course, diagonal arguments had

been known since Cantor’s work, but G¨odel showed how to arithmetize the

syntactic elements of a formal system and diagonalize within that system.

Crucial elements in computability theory, such as the Turing universal ma-

chine, the Kleene µ-recursive functions, or the self reference in the Kleene’s

Recursion Theorem, all depend upon giving code numbers to computations

and elements within a computation, and in calling algorithms by their code

numbers (G¨odel numbers). These ideas spring from G¨odel’s [1931] incom-

pleteness proof.

2.2 Alonzo Church

By 1931 computability was a young man’s game. Hilbert had retired and no

longer had much inﬂuence on the ﬁeld. As the importance of G¨odel’s Incom-

pleteness Theorem began to sink in, and researchers began concentrating on

the Entscheidungsproblem, the major ﬁgures were all young. Alonzo Church

(born 1903), Kurt G¨odel (b. 1906), and Stephen C. Kleene (b. 1909) were

all under thirty. Turing (b. 1912), perhaps the most inﬂuential of all on

computability theory, was not even twenty. Only Emil Post (b. 1897) was

over thirty, and he was not yet thirty-ﬁve. These young men were about

to leave Hilbert’s ideas behind and open the path of computability for the

next two thirds of the twentieth century, which would solve the theoretical

problems and would show the way toward practical computing devices.

8

After completing his Ph.D. at Princeton in 1927, Alonzo Church spent

one year at Harvard and one year at G¨ottingen and Amsterdam. He returned

to Princeton as an Assistant Professor of Mathematics in 1929. In 1931

Church’s ﬁrst student, Stephen C. Kleene, arrived at Princeton. Church

had begun to develop a formal system now called the λ-calculus. In 1931

Church knew only that the successor function was λ-deﬁnable. Kleene began

proving that certain well-known functions were λ-deﬁnable. By the time

Kleene received his Ph.D. in 1934 he had shown that all the usual number

theoretic functions were λ-deﬁnable. On the basis of this evidence and

his own intuition, Church proposed to G¨odel around March, 1934 the ﬁrst

version of his thesis on functions which are eﬀectively calculable, the term

in the 1930’s for a function which is computable in the informal sense. (See

Davis [1965, p. 8–9].)

Deﬁnition 2.1. Church’s Thesis (First Version) [1934]. A function

if eﬀectively calculable if and only if it is λ-deﬁnable.

When Kleene ﬁrst heard the thesis, he tried to refute it by a diagonal

argument but since the λ-deﬁnable functions were only partial functions, the

diagonal was one of the rows. Instead of a contradiction, Kleene had proved

a beautiful new theorem, the Kleene Recursion Theorem whose proof is a

diagonal argument which fails (see Soare [1987, p. 36]). Although Kleene was

convinced by Church’s ﬁrst thesis, G¨odel was not. G¨odel rejected Church’s

ﬁrst thesis as “thoroughly unsatisfactory.”

2.3 Herbrand-G¨ odel Recursive Functions

From 1933 to 1939 G¨odel spent time both in Vienna pursuing his academic

career and at Fine Hall in Princeton which housed both the Princeton Uni-

versity faculty in mathematics and the Institute for Advanced Study, of

which he was a member. G¨odel spent the ﬁrst part of 1934 at Princeton.

The primitive recursive functions which he had used in his 1931 paper did

not constitute all computable functions. He expanded on a concept of Her-

brand and brought closer to the modern form. At Princeton in the spring of

1934 G¨odel lectured on the Herbrand-G¨odel recursive functions which came

to be known as the general recursive functions to distinguish them from

the primitive recursive functions which at that time were called “recursive

functions.” Soon the preﬁx “primitive” was added to the latter and the

preﬁx “general” was generally dropped from the former. G¨odel’s deﬁnition

gave a remarkably succinct system whose simple rules reﬂected the way a

mathematician would informally calculate a function using recursion.

9

Church and Kleene attended G¨odel’s lectures on recursive functions.

Rosser and Kleene took notes which appeared as G¨odel [1934]. After seeing

G¨odel’s lectures, Church and Kleene changed their formalism (especially for

Church’s Thesis) from “λ-deﬁnable” to “Herbrand-G¨odel general recursive.”

Kleene [1981] wrote,

“I myself, perhaps unduly inﬂuenced by rather chilly receptions

from audiences around 1933–35 to disquisitions on λ-deﬁnability,

chose, after general recursiveness had appeared, to put my work

in that format. . . . ”

Nevertheless, λ-deﬁnability is a precise calculating system and has close

connections to modern computing, such as functional programming.

2.4 Stalemate at Princeton Over Church’s Thesis

Church reformulated his thesis, with Herbrand-G¨odel recursive functions

in place of λ-deﬁnable ones. This time without consulting G¨odel, Church

presented to the American Mathematical Society on April 19, 1935, his

famous proposition described in his paper [1936].

“In this paper a deﬁnition of recursive function of positive in-

tegers which is essentially G¨odel’s is adopted. It is maintained

that the notion of an eﬀectively calculable function of positive

integers should be identiﬁed with that of a recursive function,

. . . ”

It has been known since Kleene [1952] as Church’s Thesis in the following

form.

Deﬁnition 2.2. Church’s Thesis [1936]. A function on the positive

integers is eﬀectively calculable if and only if it is recursive.

As further evidence, Church and Kleene had shown the formal equiva-

lence of the Herbrand-G¨odel recursive functions and the λ-deﬁnable func-

tions. Kleene introduced a new equivalent deﬁnition, the µ-recursive func-

tions, functions deﬁned by the ﬁve schemata for primitive recursive func-

tions, plus the least number operator µ. The µ-recursive functions had the

advantage of a short standard mathematical deﬁnition, but the disadvan-

tage that any function not primitive recursive could be calculated only by a

tedious arithmetization as in G¨odel’s Incompleteness Theorem.

10

2.5 G¨ odel’s Thoughts on Church’s Thesis

In spite of this evidence, G¨odel still did not accept Church’s Thesis by the

beginning of 1936. G¨odel had become the most prominent ﬁgure in math-

ematical logic. It was his approval that Church wanted most. Church had

solved the Entscheidungsproblem only if his characterization of eﬀectively

calculable functions was accurate. G¨odel had considered the question of

characterizing the calculable functions in [1934] when he wrote,

“[Primitive] recursive functions have the important property that,

for each given set of values for the arguments, the value of the

function can be computed by a ﬁnite procedure

3

.”

Footnote 3.

“The converse seems to be true, if, besides recursion according to

scheme (V) [primitive recursion], recursions of other forms (e.g.,

with respect to two variables simultaneously) are admitted. This

cannot be proved, since the notion of ﬁnite computation is not

deﬁned, but it serves as a heuristic principle.”

The second paragraph, G¨odel’s footnote 3, gives crucial insight into his

thinking about the computability thesis and his later pronouncements about

the achievements of Turing versus others. G¨odel says later that he was not

sure that his system of Herbrand-G¨odel recursive functions comprised all

possible recursions. Second, his ﬁnal sentence suggests that he may have

believed such a characterization “cannot be proved,” but is a “heuristic

principle.”

This suggests that G¨odel was waiting not only for a formal deﬁnition

(such as recursive functions or Turing machines which came later) but evi-

dence that these captured the informal notion of eﬀectively calculable (which

Turing later gave, but which G¨odel did not ﬁnd in Church’s work). Here

he even suggests that such a precise mathematical characterization of the

informal notion cannot be proved which makes his acceptance of Turing’s

later work even more impressive.

3 Turing Breaks the Stalemate

3.1 Turing Machines and Turing’s Thesis

At the start of 1936 those gathered at Princeton: G¨odel, Church, Kleene,

Rosser, and Post nearby at City College in New York, constituted the most

11

distinguished and powerful group in the world investigating the notion of

a computable function and Hilbert’s Entscheidungsproblem, but they could

not agree on whether recursive functions constituted all eﬀectively calculable

functions. At that moment stepped forward a twenty-two year old youth,

far removed from Princeton. Well, this was not just any youth. Alan Turing

had already proved the Central Limit Theorem in probability theory, not

knowing it had been previously proved, and as a result Turing had been

elected a Fellow of King’s College, Cambridge.

The work of Hilbert and G¨odel had become well-known around the world.

At Cambridge University topologist M.H.A. (Max) Newman gave lectures

on Hilbert’s Entscheidungsproblem in 1935. Alan Turing attended. Turing’s

mother had had a typewriter which fascinated him as a boy. He designed

his automatic machine (a-machine) as a kind of idealized typewriter with

an inﬁnite carriage over which the reading head passes with the ability to

read, write, and erase one square at a time before moving to an immediately

adjacent square, just like a typewriter.

Deﬁnition 3.1. Turing’s Thesis [1936]. A function is intuitively com-

putable (eﬀectively calculable) if and only if it is computable by a Tur-

ing machine, i.e., an automatic machine (a-machine), as deﬁned in Turing

[1936].

Turing showed his solution to the astonished Max Newman in April,

1936. The Proceedings of the London Mathematical Society was reluctant

to publish Turing’s paper because Church’s had already been submitted to

another journal on similar material. Newman persuaded them that Tur-

ing’s work was suﬃciently diﬀerent, and they published Turing’s paper in

volume 42 on November 30, 1936 and December 23, 1936. There has been

considerable misunderstanding in the literature about exactly when Turing’s

seminal paper was published. This is important because of the appearance

in 1936 of related papers by Church, Kleene, and Post, and Turing’s priority

is important here.

1

1

Many papers, Kleene [1943, p. 73], [1987], [1987b], Davis [1965, p. 72], Post [1943,

p. 20], G¨ odel Collected Works, Vol. I, p. 456, and others, mistakenly refer to this paper

as “Turing [1937],” perhaps because the volume 42 is 1936-37 covering 1936 and part

of 1937, or perhaps because of the two page minor correction [1937a]. Others, such as

Kleene [1952], [1981], [1981b], Kleene and Post [1954, p. 407], Gandy [1980], Cutland

[1980], and others, correctly refer to it as “[1936],” or sometimes “[1936-37].” The journal

states that Turing’s manuscript was “Received 28 May, 1936–Read 12 November, 1936.”

It appeared in two sections, the ﬁrst section of pages 230–240 in Volume 42, Part 3, issued

on November 30, 1936, and the second section of pages 241–265 in Volume 42, Part 4,

12

Turing’s a-machine has compelling simplicity and logic which makes it

even today the most convincing model of computability. Equally important

with the Turing machine was Turing’s analysis of the intuitive conception of

a “function produced by a mechanical procedure.” In a masterful demon-

stration, which Robin Gandy considered as precise as most mathematical

proofs, Turing analyzed the informal nature of functions computable by a

ﬁnite procedure and demonstrated that they coincide with those computable

by an a-machine. Also Turing [1936, p. 243] introduced the universal Turing

machine which has great theoretical and practical importance.

3.2 G¨ odel’s Opinion of Turing’s Work

G¨odel never accepted Church’s Thesis in the form above, even though it

was formulated with his own general recursive functions, but G¨odel and

most others accepted Turing’s Thesis. G¨odel knew of the extensional ev-

idence. Church and Kleene [1936b] had shown the formal equivalence of

λ-deﬁnable functions, general recursive functions, and Kleene had proved

the equivalence with µ-recursive functions based on G¨odel’s own arithme-

tization of 1931. G¨odel was also well aware of Turing’s proof [1937b] of

the equivalence of λ-deﬁnable functions with Turing computable ones, and

hence the conﬂuence of all the known deﬁnitions.

However, G¨odel was interested in the intensional analysis of ﬁnite pro-

cedure as given by Turing [1936]. He had not accepted the argument of

conﬂuence as suﬃcient to justify Church’s Thesis. G¨odel clearly expresses

his opinion in his three volume collected works, G¨odel [1986], G¨odel [1990],

and G¨odel [1995]. Let us examine there what G¨odel has to say. In the

following article G¨odel considers all these as equivalent formal deﬁnitions.

The question was whether they captured the informal concept of a function

speciﬁed by a ﬁnite procedure. The best source for articles of G¨odel is the

three volume Collected Works, which we have listed by year of publication:

Volume I, G¨odel [1986]; Volume II, G¨odel [1990], and Volume III, G¨odel

[1995].

issued December 23, 1936. No part of Turing’s paper appeared in 1937, but the two page

minor correction [1937a] did. Determining the correct date of publication of Turing’s work

is important to place it chronologically in comparison with Church [1936], Post [1936], and

Kleene [1936].

13

3.2.1 G¨odel [193?] Notes in Nachlass [1935]

This article has an introductory note by Martin Davis in G¨odel [1995, p. 156].

Davis wrote, “This article is taken from handwritten notes in English, ev-

idently for a lecture, found in the Nachlass in a spiral notebook.” In the

Nachlass printed in G¨odel [1995, p. 166] G¨odel wrote,

“When I ﬁrst published my paper about undecidable proposi-

tions the result could not be pronounced in this generality, be-

cause for the notions of mechanical procedure and of formal sys-

tem no mathematically satisfactory deﬁnition had been given at

that time. . . .

The essential point is to deﬁne what a procedure is.”

To formally capture this crucial informal concept, G¨odel, who was giving

an introductory lecture, began with a deﬁnition of the primitive recursive

functions (which he quickly proved inadequate by a diagonal argument)

and then his own Herbrand-G¨odel recursive functions on p. 167. (G¨odel

gave the Herbrand-G¨odel recursive function deﬁnition rather than Turing

machines because he knew they were equivalent. He intended his talk to be

as elementary as possible for a general audience, which he knew would be

more familiar with recursion.) G¨odel continued on p. 168,

“That this really is the correct deﬁnition of mechanical com-

putability was established beyond any doubt by Turing.”

The word “this” evidently refers to the recursive functions. G¨odel knew

that Turing had never proved anything about recursive functions. What

did he mean? G¨odel knew that by work of Turing, Church, and Kleene,

the formal classes of Turing computable functions, recursive functions, and

λ-deﬁnable functions all coincided. G¨odel was asserting that it was Turing

who had demonstrated that these formal classes captured the informal no-

tion of a procedure. It was Turing’s proof [1936] and the formal equivalences

which had elevated Herbrand-G¨odel recursive functions to a correct charac-

teristic of eﬀectively calculable functions, not that the Herbrand-G¨odel re-

cursive functions had elevated Turing computable functions. Indeed G¨odel

had seen Church’s Thesis 2.2 expressed in terms of Herbrand-G¨odel recur-

sive functions, and had rejected it in 1935 and 1936 because he was not sure

his own deﬁnition had captured the informal concept of procedure.

G¨odel had begun with the recursive function as more easily explained to

a general audience, but having introduced Turing, G¨odel now went forward

with Turing’s work.

14

“But Turing has shown more. He has shown that the computable

functions deﬁned in this way are exactly those for which you can

construct a machine with ﬁnite number of parts which will do

the following thing. If you write down any number n

1

, . . . n

r

,

on a slip of paper and put the slip into the machine and turn

the crank then after ﬁnite number of turns the machine will stop

and the value of the function for the argument n

1

, . . . n

r

will be

printed on the paper.”

3.2.2 Princeton Bicentennial [1946]

To fully understand this article one should be familiar with G¨odel’s

¨

Uber die

L¨ange von Beweisen” (“On the length of proofs) [1936a] in Volume I [1986,

p. 396–398]. G¨odel discussed what it means for a function to be computable

in a formal system S and remarked that given a sequence of formal systems

S

i

, S

i+1

. . . it is possible that passing from one formal system S

i

to one of

higher order S

i+1

not only allows us to prove certain propositions which were

not provable before, but also makes it possible to shorten by an extraordinary

amount proofs already available.

Now for G¨odel’s Princeton Bicentennial address [1946] refer to the Col-

lected Works Volume II, G¨ odel [1990, p. 150]. G¨odel muses on the remark-

able fact of the absoluteness of computability, that it is not necessary to

distinguish orders (diﬀerent formal systems). Once we have a suﬃciently

strong system (such as Peano arithmetic) we can prove anything about com-

putable functions which could be proved in a more powerful system. Once

again, G¨odel identiﬁes those formal systems known to be equivalent, general

recursiveness, Turing computability, and others, as a single formal system.

“Tarski has stressed in his lecture (and I think justly) the great

importance of the concept of general recursiveness (or Turing’s

computability). It seems to me that this importance is largely

due to the fact that with this concept one has for the ﬁrst time

succeeded in giving an absolute deﬁnition of an interesting episte-

mogical notion, i.e., one not depending on the formalism chosen.

2

In all other cases treated previously, such as demonstrability or

deﬁnability, one has been able to deﬁne them only relative to a

given language, and for each individual language it is clear that

the one thus obtained is not the one looked for. For the concept

2

. . . “A function of integers is computable in any formal system containing arithmetic

if and only if it is computable in arithmetic” . . . .

15

of computability, however, although it is merely a special kind of

demonstrability or decidability, the situation is diﬀerent. By a

kind of miracle it is not necessary to distinguish orders, and the

diagonal procedure does not lead outside the deﬁned notion.”

G¨odel stated,

“. . . one has for the ﬁrst time succeeded in giving an absolute

deﬁnition of an interesting epistemogical notion . . . ”

Who is the “one” who has linked the informal notion of procedure or

eﬀectively calculable function to one of the formal deﬁnitions. This becomes

irrefutably clear in '3.2.5.

3.2.3 The Flaw in Church’s Thesis

G¨odel himself was the ﬁrst to provide one of the formalisms later recognized

as a deﬁnition of computability, the general recursive functions. However,

G¨odel himself never claimed to have made this link. Church claimed it in

his announcement of Church’s Thesis in 1935 and 1936, but G¨odel did not

accept it then and gave no evidence later of believing that Church had done

this. Modern scholars found weaknesses in Church’s attempted proof [1936]

that the recursive functions constituted all eﬀectively calculable functions.

If the basic steps are stepwise recursive, then it follows easily by the

Kleene Normal Form Theorem which Kleene had proved and communicated

to G¨odel before November, 1935 (see Kleene [1987b], p. 57]), that the entire

process is recursive. The fatal weakness in Church’s argument was the core

assumption that the atomic steps were stepwise recursive, something he did

not justify. Gandy [1988, p. 79] and especially Sieg [1994, pp. 80, 87] in

their excellent analyses brought out this weakness in Church’s argument.

Sieg [p. 80] wrote, “. . . this core does not provide a convincing analysis:

steps taken in a calculus must be of a restricted character and they are

assumed, for example by Church, without argument to be recursive.” Sieg

[p. 78] wrote, “It is precisely here that we encounter the major stumbling

block for Church’s analysis, and that stumbling block was quite clearly seen

by Church,” who wrote that without this assumption it is diﬃcult to see

how the notion of a system of logic can be given any exact meaning at all.

It is exactly this stumbling block which Turing overcame by a totally new

approach.

16

3.2.4 G¨odel on Church’s Thesis

G¨odel may not have found errors in Church’s demonstration, but he never

gave any hint that he thought Church had been the ﬁrst to show that the

recursive functions coincided with the eﬀectively calculable ones. On the

contrary, G¨odel said,

“As for previous equivalent deﬁnitions of computability, which,

however, are much less suitable for our purpose, [i.e., verifying

the Computability Thesis], see A. Church 1936, pp. 256–358.”

– G¨odel, Princeton Bicentennial, [1946, p. 84], and G¨odel

Collected Works, Vol. I, pp 150–153.

3.2.5 G¨odel’s Letter to Kreisel [1968]

-G¨odel: letter to Kreisel of May 1, 1968 [Sieg, 1994, p. 88].

“ But I was completely convinced only by Turing’s paper.”

3.2.6 Gibbs Lecture [1951]

G¨odel, Collected Works Volume III, [G¨odel, 1995, p.304–305].

Martin Davis in his introduction wrote,

“On 26 December 1951, at a meeting of the American Mathe-

matical Society at Brown University, G¨odel delivered the twenty-

ﬁfth Josiah Willard Gibbs Lecture, “Some basic theorems on the

foundations of mathematics and their implications.” . . .

It is probable as Wang suggests ([1987, pages 117–18]), that the lecture

was the main project G¨odel worked on in the fall of 1951. . . . “

G¨odel [1951] in his Gibbs lecture wrote,

“Research in the foundations of mathematics during the past few

decades has produced some results of interest, not only in them-

selves, but also with regard to their implications for the tradi-

tional philosophical problems about the nature of mathematics.

The results themselves, I believe, are fairly widely known, but

nevertheless I think it will be useful to present them in outline

once again, especially in view of the fact that due to the work

17

of various mathematicians, they have taken on a much more

satisfactory form than they had had originally. The greatest im-

provement was made possible through the precise deﬁnition of

the concept of ﬁnite procedure, [“ . . . equivalent to the concept of

a ’computable function of integers’ . . . ”] which plays a decisive

role in these results. There are several diﬀerent ways of arriving

at such a deﬁnition, which, however, all lead to exactly the same

concept. The most satisfactory way, in my opinion, is that of

reducing the concept of a ﬁnite procedure to that of a machine

with a ﬁnite number of parts, as has been done by the British

mathematician Turing.”

In this one paragraph,

1. G¨odel stressed the importance of the results to mathematics and phi-

losophy.

2. G¨odel gave full credit to Turing and his “machine with a ﬁnite number

of parts” for capturing the concept of ﬁnite procedure.

3. G¨odel never mentions Church or G¨odel’s own deﬁnition of recursive

functions.

This is one of the most convincing and explicit demonstrations of G¨odel’s

opinion of Turing’s work.

3.2.7 Godel’s Postscriptum 3 June, 1964 to G¨odel [1934]

-Godel’s Postscriptum 3 June, 1964 to G¨odel [1934], see “The Un-

decidable,” M. Davis, [1965, p. 71] and G¨odel Collected Works, Volume I

[1986, p. 369–370].

“ In consequence of later advances, in particular of the fact that,

due to A. M. Turing’s work, a precise and unquestionably ade-

quate deﬁnition of the general concept of formal system can now

be given, the existence of undecidable arithmetical propositions

and the non-demonstrability of the consistency of a system in the

same system can now be proved rigorously for every consistent

formal system containing a certain amount of ﬁnitary number

theory.”

18

Turing’s work gives an analysis of the concept of “mechanical

procedure” (alias “algorithm” or “computation procedure” or

“ﬁnite combinatorial procedure”). This concept is shown to be

equivalent with that of a “Turing machine.”

3.3 Hao Wang Reports on G¨ odel

Hao Wang was a very close friend and professional colleague of G¨odel, whom

he called “G” in the following passage. Wang [1987, p. 96] wrote about

G¨odel’s opinion of Turing’s work.

“Over the years G habitually credited A.M. Turing’s paper of

1936 as the deﬁnitive work in capturing the intuitive concept [of

computability], and did not mention Church or E. Post in this

connection. He must have felt that Turing was the only one who

gave persuasive arguments to show the adequacy of the precise

concept . . . In particular, he had probably been aware of the

arguments oﬀered by Church for his “thesis” and decided that

they were inadequate. It is clear that G and Turing (1912–1954)

had great admiration for each other, . . . “

3.4 Kleene’s Remarks About Turing

“Turing’s computability is intrinsically persuasive” but “λ-de-

ﬁnability is not intrinsically persuasive” and “general recursive-

ness scarcely so (its author G¨odel being at the time not at all

persuaded).”

-Stephen Cole Kleene [1981b, p. 49]

“Turing’s machine concept arises from a direct eﬀort to ana-

lyze computation procedures as we know them intuitively into

elementary operations. Turing argued that repetitions of his el-

ementary operations would suﬃce for any possible computation.

“ For this reason, Turing computability suggests the thesis more

immediately than the other equivalent notions and so we choose

it for our exposition.”

-Stephen Cole Kleene, second book [1967, p. 233]

19

3.5 Church’s Remarks About Turing

Computability by a Turing machine, “ has the advantage of mak-

ing the identiﬁcation with eﬀectiveness in the ordinary (not ex-

plicitly deﬁned) sense evident immediately—i.e., without the ne-

cessity of proving preliminary theorems.”

-Alonzo Church [1937], Review of Turing [1936]

In modern times it is sometimes stated as follows, recognizing that

Church [1935], [1936] got it ﬁrst, but that Turing [1936] got it right, in

the opinion of G¨odel and many modern scholars.

Deﬁnition 3.2. Church-Turing Thesis. A function is intuitively com-

putable if and only if it is computable by a Turing machine, or equivalently

if it is speciﬁed by a recursive function.

We strongly believe that it should not be called any of the three (Church’s

Thesis, Turing’s Thesis, or the Church-Turing Thesis) but rather should be

called the “Computability Thesis” as we argue in '13 and '14, just as the

calculus is named for neither of its discoverers, Newton and Leibniz.

4 Oracle Machines and Relative Computability

After introducing deﬁnitions of computable functions: Turing a-machines,

recursive functions, and λ-deﬁnable functions; the originators continued dur-

ing 1936–1939 to explore incomputable phenomena, rather than computable

applications of these devices, which came only a decade or more later.

Church and Kleene [1936] as well as Church [1938] and Kleene [1938] studied

computable well-orderings and deﬁned recursive ordinals which were later

used to extend the jump operation to the arithmetic hierarchy and beyond

to the hyperarithmetic hierarchy up to the ﬁrst nonrecursive ordinal ω

CK

1

.

Turing spent 1936–1938 at Princeton working on a Ph.D. with Church.

His thesis was completed in 1938 and published in Turing [1939]. Church

and other mathematicians had found G¨odel’s Incompleteness Theorem un-

settling. By G¨odel’s proof an eﬀective extension T

1

of Peano arithmetic

cannot prove its own consistency con

T

1

. However, we can add the arithmeti-

cal statement con

T

1

to T

1

to get a strictly stronger theory T

2

. Continuing,

we can get an increasing hierarchy of theories ¦T

α

¦

α∈S

over a set S of or-

dinals. Turing’s Ph.D. thesis [1939] concerned such an increasing array of

undecidable theories.

20

4.1 Turing’s Oracle Machines

In one of the most important and most obscure parts of all of computability

theory, Turing wrote in his ordinal logics paper [1939, '4] a short statement

about oracle machines.

“Let us suppose we are supplied with some unspeciﬁed means of

solving number-theoretic problems; a kind of oracle as it were.

. . . this oracle . . . cannot be a machine.

With the help of the oracle we could form a new kind of ma-

chine (call them o-machines), having as one of its fundamental

processes that of solving a given number-theoretic problem.”

This is virtually all Turing said of oracle machines. His description was

only a page long and half of that was devoted to the unsolvability of related

problems such as whether an o-machine will output an inﬁnite number of

0’s or not.

In 1939 Turing left this topic never to return. It mostly lay dormant

for ﬁve years until it was developed in a beautiful form by Post [1944],

[1948], and other papers as we shall explain in '5 and '6. Before doing so,

we complete this section '4.1 with a modern treatment of oracle machines

and Turing functionals including some of the more important properties even

though these were mostly discovered much later, even after Post. More mod-

ern properties of Turing functionals, such as eﬀective continuity on Cantor

space, will be developed in '7.6.

4.2 Modern Deﬁnitions of Oracle Machines

There are several equivalent ways that a Turing machine with oracle may be

deﬁned. We prefer the deﬁnition in Soare’s book [1987, p. 46] of a machine

with a head which reads the work tape and oracle tape simultaneously, but

many other formulations produce the same class of functionals.

Deﬁnition 4.1. A Turing oracle machine (o-machine) is a Turing machine

with an extra “read only” tape, called the oracle tape, upon which is writ-

ten the characteristic function of some set A (called the oracle), and whose

symbols cannot be printed over. The old tape is called the work tape and

operates just as before. The reading head moves along both tapes simulta-

neously. As before, Q is a ﬁnite set of states, S

1

= ¦B, 0, 1¦ is the oracle

tape alphabet, S

2

= ¦B, 1¦ is the work tape alphabet, and ¦R, L¦ the set of

21

head moving operations right and left. A Turing oracle program

P

e

is now

simply a partial map,

δ : QS

1

S

2

−→ QS

2

¦R, L¦,

where δ(q, a, b) = (p, c, X) indicates that the machine in state q reading

symbol a on the oracle tape and symbol b on the work tape passes to state

p, prints “c” over “b” on the work tape, and moves one space right (left) on

both tapes if X = R (X = L). The other details are just as previously in

Soare [1987]. The Turing oracle program

P

e

takes some oracle A and deﬁnes

a partial A-computable functional Φ

A

e

(x) = y.

Notation 4.2. (i) We let lower case Greek letters ϕ, ψ represent partial

functions from ω to ω and lower case Latin letters f, g, and h represent

total functions.

(ii) We let upper case Greek letters represent partial functionals from 2

ω

to 2

ω

. If A ⊆ ω then Ψ

A

(x) may be deﬁned for some or all x. If B ⊆ ω we

write Ψ

A

= B if Ψ

A

(x) = B(x) for all x ∈ ω.

(iii) As in Soare [1987] we use ¦P

e

¦

e∈ω

for an eﬀective listing of Turing

programs for Turing a-machines and let ϕ

e

be the partial computable func-

tion deﬁned by P

e

. We let ¦

P

e

¦

e∈ω

be an eﬀective listing of oracle Turing

programs, and let Φ

e

be the computable partial functional deﬁned by

P

e

. If

Φ

A

e

is total and computes B we say B is computable in A and write B ≤

T

A.

We refer to ϕ

e

as a partial computable function ω to ω because its input and

output are integers. On the other hand, Φ

A

e

is called a partial computable

functional because it takes a set A to a set B and is viewed as a map on

Cantor Space 2

ω

.

(iv) Since Rogers book [1967], researchers have used ϕ

e

(x) or ¦e¦(x) for the

partial computable function with program P

e

. Since Lachlan about 1970,

researchers have used Φ

A

e

(x) for the Turing functional with oracle program

P

e

and have used ϕ

A

e

(x) for the use function, the maximum element of A

examined during the computation. Lachlan also used matched pairs Ψ, ψ;

Γ, γ and so forth for partial computable functionals and their use functions

in many papers, and this is the general usage today. There is no confusion

between the notation ϕ

e

(x) as a partial computable function and ϕ

A

e

(x) as a

use function for Φ

A

e

(x) because the former ϕ

e

(x) will never have an exponent

A and the latter use function ϕ

A

e

(x) always will.

22

4.2.1 The Graph of a Partial Computable Function

Deﬁnition 4.3. Given a partial computable (p.c) function ϕ

e

deﬁne the

graph of ϕ

e

as follows.

(1) g

e

= graph(ϕ

e

) =

dfn

¦ 'x, y` : ϕ

e

(x) = y ¦

Note that if ϕ

e

is a partial computable (p.c.) function then graph(ϕ

e

)

is a computable enumerable (c.e.) set. Likewise, given any (c.e.) set W

e

we can ﬁnd a single-valued c.e. subset V

e

⊆ W

e

which is the graph of a p.c.

function. The the notions of a Turing program to compute a p.c. function

ψ and a description of its graph are interchangeable and equally powerful in

describing ψ.

4.2.2 The Graph of an Oracle Computable Functional

Deﬁnition 4.4. For an oracle machine program

P

e

we likewise deﬁne the

oracle graph of the corresponding computable functional Φ

e

but now tak-

ing into consideration the ﬁnite strings read by the oracle head during the

computation.

(2) G

e

=

dfn

graph(Φ

e

) =

dfn

¦ 'σ, x, y` : Φ

σ

e

(x) = y ¦

where σ ranges over 2

<ω

,

Here Φ

σ

e

(x) = y denotes that the oracle program

P

e

with oracle σ on its

oracle tape, and x on its input tape, eventually halts and outputs y, and

does not read more of the oracle tape than σ during the computation. The

crucial property of the oracle graph G

e

and the one which makes a Turing

functional Φ

e

independent of any particular machine representation is the

following.

4.3 The Oracle Graph Theorem

Theorem 4.5. Oracle Graph Theorem. If

P

e

is an oracle Turing pro-

gram deﬁning a Turing functional Φ

e

, then the graph G

e

deﬁned in (2) is a

computably enumerable (c.e.) set.

Proof. From the deﬁnitions G

e

is Σ

0

1

and therefore c.e.

The converse holds for a c.e. set V which satisﬁes a singlevaluedness

condition (3) and a continuity condition (4).

23

Theorem 4.6. Let V ⊂ 2

<ω

ω ω be a computably enumerable set which

satisﬁes the following two conditions. Then there is a Turing functional Φ

e

such that G

e

= V .

(3) 'σ, x, y` ∈ V =⇒ (∃τ ⊇ σ)(∃z)[ z = y & 'τ, x, z` ∈ V ].

(4) 'σ, x, y` ∈ V =⇒ (∀τ ⊃ σ)[ 'τ, x, y` ∈ V ].

Proof. Given V satisfying (3) and (4) deﬁne a partial computable functional

Ψ

σ

(x) as follows. If 'σ, x, y` appears in V deﬁne Ψ

σ

(x) = y. This deﬁnes an

eﬀective reduction Ψ. There must be a Turing oracle machine Φ

e

such that

Φ

e

= Ψ.

Theorem 4.7. Furthermore, given any c.e. set U ⊆ 2

<ω

ω ω there is a

c.e. subset V ⊆ U satisfying (3) and (4) and having the same domain, i.e.,

¦x : (∃σ)(∃y)[ 'σ, x, y` ∈ U ]¦ = ¦x : (∃σ)(∃y)[ 'σ, x, y` ∈ V ]¦.

Proof. Similar to single valuedness theorem in Soare [1987, Chapter II].

4.4 Equivalent Deﬁnitions of Relative Computability

There are several diﬀerent formal deﬁnitions of relative computability. This

includes an oracle machine with a single reading head reading the work

tape and oracle tape, or two independent reading heads, or other varia-

tions. In addition, several authors deﬁne relative computability from oracle

A by adding the characteristic function of A either to the Herbrand-G¨odel

general recursive function deﬁnition or to the Kleene µ-recursive function

deﬁnition. Each of these formal deﬁnitions produces a c.e. graph G

e

and

these deﬁnitions are all equivalent.

Furthermore, any Turing a-machine can clearly be simulated by a Turing

o-machine as we note in the following theorem. Therefore, in presenting the

subject we can bypass a-machines altogether, present o-machines, and then

draw a-machines as special cases. This reinforces the claim that it is the

o-machine, not the a-machine, which is the central concept of the subject.

Theorem 4.8. If P

e

is a Turing program for a Turing a-machine, then there

is a Turing oracle program

P

i

which on input x and any oracle A produces

the same output y.

Proof. Let P

e

be a Turing program to compute ϕ

e

. Now P

e

consists of a

ﬁnite partial map which can be identiﬁed with a set of 5-tuples,

δ : QS

2

−→ QS

2

¦R, L¦,

24

where Q is a ﬁnite set of states, S

2

= ¦B, 1¦ is the work tape alphabet, and

¦R, L¦ the set of head moving operations right and left. Deﬁne an oracle

program

P

i

as follows with transition function

δ : QS

1

S

2

−→ QS

2

¦R, L¦,

for S

1

= ¦B, 0, 1¦ the oracle tape alphabet as follows. For each line in P

e

of the form δ(q, a) = (p, b, X) for p, q ∈ Q and a, b ∈ S

2

, we add to oracle

program

P

i

a line

δ(q, c, a) = (p, b, X) for both c = 0 and c = 1. Hence,

P

i

has exactly the same eﬀect on input x as P

e

regardless of the oracle A.

4.4.1 Notation for Functions and Functionals

The standard notation is that given above.

Remark 4.9. Note that the oracle Turing machine Φ

e

is a ﬁnite object

represented by an oracle program

P

e

or an oracle graph G

e

and has no oracle

associated with it, but it can use any oracle A which may be attached. This

is analogous to a laptop computer with no active connection to a database

which may later be connected to the World Wide Web.

Recently, some researchers have unfortunately used Φ

e

to denote ϕ

e

.

This is unwise because it blurs the distinction of types in which ϕ

e

operates

on integers and Φ

e

on sets. Furthermore, sometimes we would like to write

Φ

e

alone without its exponent A to identify it with

P

e

or its oracle graph

G

e

as a ﬁnite object, like a laptop computer whose link with the web has

temporarily been removed. Doing so under the new convention leads to con-

fusion with ϕ

e

which is given by a diﬀerent type of program. The functional

Φ

e

is deﬁned by a program

P

e

which is a ﬁnite set of 6-tuples operating on

sets, while ϕ

e

is deﬁned by P

e

a ﬁnite set of 5-tuples operating on integers.

Furthermore, there is no justiﬁcation for the necessity of Φ

e

to denote ϕ

e

since the current notation ϕ

e

is quite satisfactory. We recommend against

using Φ

e

to denote ϕ

e

the partial computable function.

5 Emil Post Expands Turing’s Ideas

The spirit of Turing’s work was taken up by the American mathematician

Emil Post, who had been appointed to a faculty position at City College of

New York in 1932.

25

5.1 Post’s Work in the 1930’s

Post [1936] independently of Turing (but not independently of the work by

Church and Kleene in Princeton) had deﬁned a “ﬁnite combinatory pro-

cess” which closely resembles a Turing machine. From this it is often and

erroneously written (Kleene [1987b, p. 56], and [1981, p. 61]) that Post’s

contribution here was “essentially the same” as Turing’s, but in fact it was

much less. Post did not attempt to prove that his formalism coincided with

any other formalism, such as general recursiveness, but merely expressed

the expectation that this would turn out to be true, while Turing [1937b]

proved the Turing computable functions equivalent to the λ-deﬁnable ones.

Post gave no hint of a universal Turing machine. Most important, Post gave

no analysis, as did Turing, of why the intuitively computable functions are

computable in his formal system. Post oﬀers only as a “working hypoth-

esis” that his contemplated “wider and wider formulations” are “logically

reducible to formulation 1.” Lastly, Post, of course, did not prove the un-

solvability of the Entscheidungsproblem because at the time Post was not

aware of Turing’s [1936], and Post believed that Church [1936] had settled

the Entscheidungsproblem. Furthermore, Post wrote [1936] that Church’s

identiﬁcation of eﬀective calculability and recursiveness was working hy-

pothesis which is in “need of continual veriﬁcation.” This irritated Church

who criticized it in his review [1937b] of Post [1936].

Post’s contributions during the 1930’s were original and insightful, cor-

responding in spirit to Turing’s more than to Church’s, but they were not

as inﬂuential as those of Church and Turing. It was only during the next

phase from 1940 to 1954 that Post’s remarkable inﬂuence was fully felt.

5.2 Post Steps Into Turing’s Place During 1940–1954

As Turing left the subject of pure computability theory in 1939, his mantle

fell on the shoulders of Post. This was the mantle of clarity and intuitive ex-

position, the mantle of exploring the most basic objects such as computably

enumerable sets, and most of all, the mantle of relative computability and

Turing reducibility. During the next decade and a half from 1940 until his

death in 1954, Post played an extraordinary role in shaping the subject.

Post [1941] and [1943] introduced a second and unrelated formalism

called a production system and (in a restricted form) a normal system,

which he explained again in [1944]. Post’s (normal) canonical system is

a generational system, rather than a computational system as in general

recursive functions or Turing computable functions, because it gives an al-

26

gorithm for generating (listing) a set of integers rather than computing a

function. This led Post to concentrate on eﬀectively enumerable sets rather

than computable functions. Post, like Church and Turing, gave a thesis

[1943, p. 201], but stated it in terms of generated sets and production sys-

tems, which asserted that “any generated set is a normal set.” That is,

any eﬀectively enumerable set in the intuitive sense could be produced as a

normal set is his formal system. Although he had used other terminology

earlier, by the 1940’s Post had adopted the Kleene-Church terminology of

“recursively enumerable set” for the formal equivalent of Post’s eﬀectively

enumerable set.

Deﬁnition 5.1. [Post’s Thesis, 1943, 1944]. A nonempty set is eﬀec-

tively enumerable (listable in the intuitive sense) iﬀ it is recursively enumer-

able (the range of a recursive function) or equivalently iﬀ it is generated by

a (normal) production system.

Post showed that every recursively enumerable set (one formally gen-

erated by a recursive function) is a normal set (one derived in his normal

canonical system) and conversely. Therefore, normal sets are formally equiv-

alent to recursively enumerable sets. Since recursively enumerable sets are

equideﬁnable with partial computable functions, this deﬁnition of normal set

gives a new formal deﬁnition of computability which is formally equivalent

to the deﬁnitions of Church or Turing. (Equideﬁnable here means that from

the deﬁnition of a partial computable function we can derive a c.e. set as its

range and from the deﬁnition of a c.e. set one can ﬁnd a single valued c.e.

subset which is the graph of a partial computable function.) Post’s Thesis

is equivalent to Turing’s Thesis.

Post used the terms “eﬀectively enumerable set” and “generated set”

almost interchangeably, particularly for sets of positive integers. Post [1944,

p. 285], like Church [1936], deﬁned a set of positive integers to be recur-

sively enumerable if it is the range of a recursive function and then stated,

“The corresponding intuitive concept is that of an eﬀectively enumerable

set of positive integers.” (This is Church’s [1936] terminology also). Post

[1944, p. 286], explained his informal concept of a “generated set” of positive

integers this way,

“Suﬃce it to say that each element of the set is at some time

written down, and earmarked as belonging to the set, as a result

of predetermined eﬀective processes. It is understood that once

an element is placed in the set, it stays there.”

Post then [1944, p. 286], restated Post’s Thesis 5.1 in the succinct form,

27

“every generated set of positive integers is recursively enumer-

able.”

He remarked that “this may be resolved into the two statements: every

generated set is eﬀectively enumerable, every eﬀectively enumerable set of

positive integers is recursively enumerable.” Post continued, “their con-

verses are immediately seen to be true.” Post’s concentration on c.e. sets

rather than partial computable functions may be even more fundamental

than the thesis of Church and Turing characterizing computable functions

because Sacks [1990] has remarked that often in higher computability the-

ory it is more convenient to take the notion of a generalized c.e. set as basic

and to derive generalized computable functions as those whose graphs are

generalized computably enumerable.

5.3 Post’s Problem on Incomplete C.E. Sets

Post’s most inﬂuential achievement during this period was the extraordinar-

ily clear and intuitive paper, Recursively enumerable sets of positive integers

and their decision problems, [1944]. Here Post introduced the terms degree

of unsolvability and the concept that one set has lower degree of unsolvability

than another. Post later expanded on these deﬁnitions in [1948].

Post’s paper [1944] revealed with intuition and great appeal the signif-

icance of the computably enumerable sets and the signiﬁcance of G¨odel’s

Incompleteness Theorem. Post called G¨odel’s diagonal set,

K = ¦e : e ∈ W

e

¦

the complete set because every c.e. set W

e

is computable in K (W

e

≤

T

K).

Moreover, Post felt that the creative property of K revealed the inherent

creativeness of the mathematical process.

5.4 Post Began With Strong Reducibilities

Post posed his famous “Post’s problem” of whether there exists a com-

putably enumerable (c.e.) set W which is not computable but which cannot

compute G¨odel’s diagonal set K, i.e., such that ∅ <

T

W <

T

K. In 1944 re-

searchers did not understand Turing reducibility, even as little as presented

above in '4. Post himself was struggling to understand it, and did not ex-

plicitly discuss it until the very end of his paper, and even then only in

general terms.

28

Post’s contributions from 1943 to 1954 concerning relative computabil-

ity are remarkable. First, Post resurrected in [1944] the concept of oracle

machines which had been buried in Turing’s [1939] paper and which other

researchers had apparently ignored for ﬁve years. Second, Post deﬁned a

sequence of strong reducibilities to better understand the concept of a set

B being reducible to a set A.

Along with these strong reducibilities, Post deﬁned families of c.e. sets

with thin complements, simple, hyper-simple, hyper-hypersimple, in an at-

tempt to ﬁnd an incomplete set for these reducibilities. These concepts have

pervaded the literature and proved useful and interesting, but they did not

lead to a solution of Post’s problem. Post was able to exhibit incomplete

incomputable c.e. sets for several of these stronger reducibilities but not for

Turing reducibility. Post’s Problem stimulated a great deal of research in

the ﬁeld and had considerable inﬂuence.

Slowly Post’s understanding deepened of the general case of one set B

being reducible (Turing reducible) to another set A. Post steadily contin-

ued gaining a deeper and deeper understanding from 1943 to 1954 until he

had brought it to full development. Our modern understanding of relative

computability and Turing functionals is due more to Post and his patient,

persistent eﬀorts over a decade and a half than it is due to the brief remark

by Turing in 1939.

6 Post Highlights Turing Computability

When Post wrote his famous paper [1944], Turing’s notion of relative com-

putability from an oracle discussed in '4.1 had been mostly ignored for ﬁve

years. It was only at the end of Post’s paper [1944] in the last section, '11

General (Turing) Reducibility, that Post deﬁned and named for the ﬁrst time

“Turing Reducibility,” denoted B ≤

T

A, and began to discuss it in intuitive

terms. Post’s four and a half page discussion there is the most revealing

introduction to eﬀective reducibility of one set from another. In the same

crisp, intuitive style as in the rest of the paper, Post described the manner

in which the decision problem for one set S

1

could be reduced to that of a

second set S

2

. Post wrote it for a c.e. set S

2

in studying Post’s problem, but

the analysis holds for any set S

2

.

6.1 Post Articulates Turing Reducibility

Post wrote in [1944, '11],

29

“Now suppose instead, says Turing [1939] in eﬀect, this situation

obtains with the following modiﬁcation. That at certain times

the otherwise machine determined process raises the question is

a certain positive integer in a given recursively enumerable set

S

2

of positive integers, and that the machine is so constructed

that were the correct answer to this question supplied on every

occasion that arises, the process would automatically continue to

its eventual correct conclusion. We could then say that the ma-

chine eﬀectively reduces the decision problem of S

1

to that of S

2

.

Intuitively, this would correspond to the most general concept

of reducibility of S

1

to S

2

. For the very concept of the decision

problem of S

2

merely involves the answering for an arbitrarily

given single positive integer m of the question is m in S

2

; and in a

ﬁnite time but a ﬁnite number of such questions can be asked. A

corresponding formulation of “Turing reducibility” should then

be the same degree of generality for eﬀective reducibility as say

general recursive function is for eﬀective calculability.”

6.2 The Post-Turing Thesis

Post’s statement may be restated in succinct modern terms and incorporates

the statement implicit in Turing [1939, '4] in the following extension of

Turing’s ﬁrst Thesis 3.1 and Post’s ﬁrst Thesis 5.1.

Deﬁnition 6.1. Post-Turing Thesis, Turing [1939 §4], Post [1944,

§11]. A set B is eﬀectively reducible to another set A iﬀ B is Turing

reducible to A by a Turing oracle machine (B ≤

T

A).

Turing’s brief introduction of oracles did not state this as a formal the-

sis, but it is largely implied by his presentation. Post makes it explicit and

claims that this is the formal equivalent of the intuitive notion of eﬀec-

tively reducible, a step as signiﬁcant as the Church-Turing characterization

of “calculable.” If we identify a Turing reduction Φ

e

with its graph G

e

both

informally and formally then the Post-Turing Thesis is equivalent to Post’s

Thesis 5.1 (because G

e

is c.e.), which is equivalent to Turing’s Thesis 3.1.

However, there has been little analysis (along the lines of the extensive

analysis of the Church-Turing Thesis 3.2 for unrelativized computations) of

what constitutes a relative computation of B from A. This is surprising

because the Post-Turing Thesis was stated clearly in Post [1944]. It is even

more surprising because relative computability is used much more often than

30

ordinary computability in the theory of computability, applications of com-

putability to other areas such as algebra, analysis, model theory, algorithmic

complexity and many more. Also interactive or online computing in the real

world is more common than batch processing or oﬄine computing, using

processes contained entirely inside the machine.

7 Continuous and Total Functionals

7.1 Representations of Open and Closed Sets

Deﬁnition 7.1. (i) Using ordinal notation identify the ordinal 2 with the

set of smaller ordinals ¦0, 1¦. Identify the sets A ⊆ ω with their character-

istic functions f : ω → ¦0, 1¦ and represent the set of such f as 2

ω

.

(ii) Let 2

<ω

denote the set of ﬁnite strings of 0

**s and 1’s, i.e., ﬁnite initial
**

segments of functions f ∈ 2

ω

. Let σ and τ represent ﬁnite strings in 2

<ω

and σ ≺ τ or σ ≺ f denote that σ is an initial segment of τ or f.

(iii) Recall the deﬁnition of a ﬁnite set D

y

with canonical index y where

D

y

= ¦x

1

< x

2

, . . . < x

k

¦ and y = 2

x

1

+ 2

x

2

. . . = 2

x

k

. Deﬁne the string σ

y

with canonical index y by σ

y

(z) = 1 if z ∈ D

y

and σ

y

(z) = 0 otherwise.

(iv) Cantor space is 2

ω

with the following topology (class of open sets). For

every σ ∈ 2

<ω

the basic open (clopen) set

^

σ

= ¦ f : f ∈ 2

ω

& σ ≺ f ¦.

The sets ^

σ

are called clopen because they are both closed and open. The

open sets of Cantor space are the countable unions of basic open sets.

(iv) Set A ⊆ 2

<ω

is an open representation of the open set ^

A

=

σ∈A

^

σ

.

We may assume A is closed upwards, i.e., σ ∈ A and σ ≺ τ implies τ ∈ A.

(v) A set ( is (topologically) closed if its complement ^

A

is open, i.e.,

( = ^

A

= (2

ω

−^

A

). In this case T =

dfn

2

<ω

−A is a closed representation

for (. Now T is closed downwards (because A is closed upwards). Hence,

we shall see that T forms a tree as in Deﬁnition 7.2 (i).

7.2 Notation for Trees

Deﬁnition 7.2. (i) A tree T ⊆ 2

<ω

is a set closed under initial segments,

i.e., σ ∈ T and τ ≺ σ imply τ ∈ T. Fix any tree T.

31

(ii) The set of inﬁnite paths through T is

(5) [ T ] = ¦ f : (∀n) [ fn ∈ T ] ¦.

Note that [ T ] is always a closed set. If ( ⊆ 2

ω

is any closed set then by

Theorem 7.3 there is a (nonunique) tree T ⊆ 2

<ω

such that ( = [ T ], which

is called a closed representation for (.

(iii) For σ ∈ T deﬁne the subtree T

σ

of nodes τ ∈ T comparable with σ,

(6) T

σ

= ¦ τ : σ _ τ or τ ≺ σ ¦.

(iv) Deﬁne the subtree of extendible nodes σ ∈ T.

(7) T

ext

= ¦ σ ∈ T : (∃f ~ σ)[ f ∈ [ T ] ] ¦

Note that if the tree T is computable then T

ext

is co-c.e. Usually for a

given tree T there are many other trees T

such that [ T ] = [ T

], i.e., many

diﬀerent representations for the same closed set [ T ]. The closed sets are

closed under ﬁnite union and countable intersection since the open sets have

the dual properties in Deﬁnition 7.1 (iii), closure under ﬁnite intersection

and countable union. The clopen sets are both open and closed, so any

countable union of them is open and any countable intersection is closed.

Theorem 7.3. If T is a tree, then [ T ] is a closed set, and for every closed

set ( there is a tree T such that ( = [ T ].

Proof. (=⇒). Given tree T let A = 2

<ω

−T. Then ^

A

is open. Therefore,

[ T ] = 2

ω

−^

A

and [ T ] is closed.

(⇐=). Given any closed ( with complement ^

A

deﬁne T by putting σ in T

if (∀τ _ σ)[ τ ∈ A]. Then T is closed downward and [ T ] = (.

Theorem 7.4. [Compactness]. The following very easy and well-known

properties hold for Cantor Space 2

ω

. The term “compactness” refers to any

of them, but particularly to (iv). These properties can be proved from one

another but here we give direct proofs of each.

(i) K¨onig’s Lemma. If T ⊆ 2

<ω

is an inﬁnite tree, then [ T ] = ∅.

(ii) If T

0

⊇ T

1

. . . is a decreasing sequence of trees with [ T

n

] = ∅ for every

n, and intersection T

ω

= ∩

n∈ω

T

n

, then [ T

ω

] = ∅.

(iii) If ¦(

i

¦

i∈ω

is a countable family of closed sets such that ∩

i∈F

(

i

= ∅ for

every ﬁnite set F ⊆ ω, then ∩

i∈ω

(

i

= ∅ also.

(iv) Finite subcover. Any open cover ¦^

σ

¦

σ∈A

⊇ 2

ω

has a ﬁnite open

subcover ¦^

σ

¦

σ∈F

⊇ 2

ω

for some ﬁnite subset F ⊆ A.

32

7.3 Dense Open Subsets of Cantor Space

Deﬁnition 7.5. Let o be Cantor space 2

ω

or Baire space ω

ω

.

(i) A set / ⊆ o is dense if (∀σ) (∃f ~ σ) [ f ∈ / ].

(ii) A set / ⊆ o is dense open if

(8) (∀τ)(∃σ _ τ)(∀f ~ σ) [ f ∈ / ].

(iii) Let T ⊆ 2

<ω

be a tree. A point f ∈ [ T ] is isolated in [ T ] if

(9) (∃σ)[ [ T

σ

] = ¦ f ¦ ].

We say that σ isolates f because ^

σ

∩[ T ] = ¦f ¦. If f is not isolated, then

f is a limit point.

(iv) A space o is separable if it has a countable base of open sets. (Both

Cantor space and Baire space are separable.)

(v) A class B ⊆ o is G

δ

, i.e., boldface Π

0

2

, if B = ∩

i

/

i

a countable

intersection of open sets /

i

.

After open and closed sets, much attention is paid in point set topology

to G

δ

sets (see Oxtoby[1971]). If the open sets /

i

are also dense open, then

they have special signiﬁcance. Banach-Mazur games can be used for ﬁnd-

ing a point f ∈ ∩

i

/

i

where the the sets /

i

are dense and open. This is

the paradigm for the ﬁnite extension constructions in computability theory

and oracle constructions as Kleene and Post, especially the Finite Extension

Paradigm of Kleene and Post, which we use to construct sets and degrees

meeting an countable sequence of “requirements.” Meeting a given require-

ment R

i

amounts to meeting the corresponding dense open set /

i

.

7.4 Eﬀectively Open and Closed Sets

Deﬁnition 7.6. (i) If A ⊆ 2

<ω

is c.e. and / = ^

A

, then / is eﬀectively

(computably) open.

(ii) If ( = 2

ω

−^

A

for A c.e., or equivalently if ( = [ T ] for a computable

tree T ⊆ 2

<ω

, then ( is eﬀectively (computably) closed.

(iii) ( ⊆ 2

ω

is a Π

0

1

class if there is a computable relation R(x) such that

(10) ( = ¦f : (∀x) R(f(x))¦.

33

We call this lightface Π

0

1

because it is deﬁned in (10) by a universal quantiﬁer

outside of a computable relation R(x).

(iv) A set ( ⊆ 2

ω

is boldface Π

1

if there is some set S ⊆ ω such that

( = ¦f : (∀x) R

S

(f(x))¦,

and we say ( is in Π

S

1

. Here R

S

denotes a relation computable in the set S

which we call the parameter determining R

S

. A set / ⊂ 2

ω

is boldface Σ

1

or Σ

S

1

if its complement 2

ω

−/ is boldface Π

1

or Π

S

1

.

Theorem 7.7. The open (closed) sets of 2

ω

are exactly the boldface Σ

1

(Π

1

) sets and any boldface set is lightface in some parameter A.

Proof. If / is open, then / = ^

A

for some countable set A. Now A de-

termines exactly which σ contribute in the countable union / = ∪

σ∈A

^

σ

.

Hence, if we ﬁx A as a parameter, then the deﬁnition and properties become

lightface Σ

A

1

, i.e., eﬀectively open relative to the oracle A. (But this entire

section is about working relative to an oracle.)

We often convert an open set / = ^

A

into the realm of computability

theory as follows. We: (1) usually ﬁx the parameter A and do a construction

which is computable relative to the parameter A; (2) often replace the open

set ^

A

by its complement the closed set ( = ^

A

; and (3) replace the closed

set by ( = [ T

A

] for a A-computable tree T. By ﬁxing the parameter A we

can apply all the methods of this chapter on A-computable constructions,

such as the Recursion Theorem, construction of an A-c.e. set B, and so

forth.

Theorem 7.8. A class ( is a Π

0

1

class iﬀ ( is eﬀectively closed, i.e., ( = [ T ]

for some computable tree T.

Proof. (=⇒). Let ( = ¦ f : (∀x) R(f(x)) ¦ for R computable. Deﬁne a

computable tree T = ¦ σ : (∀τ ⊆ σ)[R(τ)] ¦. Then [ T ] = (.

(⇐=). Let ( = [ T ] for T a computable tree. Deﬁne R(σ) iﬀ σ ∈ T. Then

¦f : (∀x) R(f(x))¦ = [ T ].

7.5 Continuous Functions on Cantor Space

In elementary calculus courses a continuous function is usually deﬁned with

δ and concepts or with limits. In advanced analysis or topology courses

34

the more general deﬁnition is presented that a function F is continuous iﬀ

the image of every basic open set is open. We state continuity now for

functionals on the Cantor space 2

ω

. For arbitrary topological spaces an

open set is an arbitrary union of basic open sets, but for Cantor space we

may take countable unions.

Deﬁnition 7.9. (i) A functional Ψ on Cantor space 2

ω

is continuous if for

every τ ∈ 2

<ω

there is a countable set X

τ

such that

(11) Ψ

−1

(^

τ

) = ∪ ¦ ^

σ

: σ ∈ X

τ

¦.

By identifying string σ

y

with code number y deﬁned in Deﬁnition 7.1 (iii)

we can think of X

τ

as a subset of ω.

(ii) A functional Ψ on Cantor space 2

ω

is total if Ψ

A

(x) is deﬁned for every

A ⊆ ω and x ∈ ω, i.e., if (∀A)(∃B)(∀x)[ Ψ

A

(x) = B(x) ].

Theorem 7.10. Let Ψ be a continuous functional on Cantor Space 2

ω

.

Then Ψ is total iﬀ for each set X

τ

of (11) there is a ﬁnite subset

X

τ

⊆ X

τ

such that,

(12) 2

ω

⊆ ∪ ¦ ^

σ

: σ ∈

X

τ

¦.

Proof. (⇐=). Given such

X

τ

for every τ we see that Ψ is total by (12).

(=⇒). Assume Ψ is total. Then for every τ there is a countable set X

τ

which covers 2

ω

in the sense of (12). Now the Compactness Theorem asserts

that any open cover of Cantor space 2

ω

has a ﬁnite subcover. Therefore, we

can replace every set X

τ

by a ﬁnite subset

X

τ

.

Note that this involves only compactness and has no computable content,

although it is usually presented in its eﬀective analogue as the theorem that

Φ

e

is total iﬀ it is a truth-table reduction.

7.6 Eﬀectively Continuous Functionals

A Turing functional Φ

e

is not only continuous but eﬀectively continuous in

the following sense.

Theorem 7.11. For Φ

e

deﬁne for every τ ∈ 2

<ω

the set of strings

(13) X

e

τ

= ¦ σ : (∃s)( ∀x < [τ[ ) [ Φ

σ

e,s

(x)↓ = τ(x) ] ¦.

Then X

e

τ

is c.e. and uniformly so in the sense that there is a computable

function h(e, τ) such that W

h(e,τ)

= X

e

τ

.

35

Proof. Use the Oracle Graph G

e

. Identify string σ with ^

σ

. Now the set of

strings ¦ X

e

τ

: τ ∈ 2

ω

¦ witnesses that the functional Φ

e

is continuous.

Deﬁnition 7.12. Since X

e

τ

is not only countable but also computably enu-

merable uniformly in e the functional Φ

e

is eﬀectively continuous, i.e., that

X

e

τ

is a computably enumerable set of strings.

7.7 Continuous Functions are Relatively Computable

We showed that any Turing functional is continuous, indeed eﬀectively con-

tinuous. Now we prove that any continuous functional on 2

ω

is a Turing

functional relative to some real parameter X ⊆ ω and therefore is eﬀectively

continuous relative to X.

Theorem 7.13. Suppose Ψ is a continuous functional on 2

ω

. Then Ψ is a

Turing functional relative to some real parameter X ⊆ ω.

Proof. Since Ψ is continuous, the inverse image of every basic open set ^

τ

,

τ ∈ 2

<ω

, is open and therefore is a countable union of basic open sets.

Hence, (identifying strings σ with their code numbers as integers) there is a

set X

τ

⊆ ω such that,

Ψ

−1

( ^

τ

) = ∪ ¦ ^

σ

: σ ∈ X

τ

¦.

Therefore, the set X = ⊕¦X

τ

: τ ∈ 2

<ω

¦ provides a complete oracle for

calculating Ψ : 2

ω

→ 2

ω

.

8 Bounded Reducibilities

8.1 A Matrix M

x

for Bounded Reducibilities

A bounded reducibility is a Turing reducibility Φ

A

e

(x) with a computable

function h(x) which bounds the use function, i.e., ϕ

A

e

(x) ≤ h(x). Given

h(x) imagine a matrix M

x

whose rows are all the strings σ of length h(x).

The action on x is entirely determined by the action of Φ

σ

e

(x) for these rows

σ ∈ M

x

. For example, if B ≤

m

A via a computable function f(x) then

this reduction is bounded by h(x) = f(x) and x ∈ B iﬀ σ(f(x)) = 1 where

σ ≺ A, i.e., where σ is an initial segment of A. In Deﬁnition 7.1 (iii) we

deﬁned σ

y

to be the string with canonical index y derived from D

y

. This

gives a method for indexing the rows σ

y

∈ M

x

.

We begin in '8.2 with the most general bounded reducibility called

bounded Turing reducibility (B ≤

bT

A) where we are given only the com-

putable bound h(x), i.e., only the matrix M

x

. In '8.3 we study the more

36

restrictive case of truth-table reducibility (B ≤

tt

A) where Φ

σ

e

(x) converges

for every x and every row σ ∈ M

x

. If Φ

σ

e

(x) diverges for even one x and

σ ∈ M

x

then the reduction is a partial bT-reduction, but if it converges for

every x and every σ ∈ M

x

then it gives a genuine truth-table as in beginning

logic courses as deﬁned in Theorem 8.3 (iii). This convergence on all strings

σ

y

∈ M

x

is the key deﬁning property for a tt-reduction as expressed in (14).

8.2 Bounded Turing Reducibility

Deﬁnition 8.1. (i) A set B is bounded Turing reducible (bT-reducible) to

a set A (B ≤

bT

A) if there is a Turing reduction Φ

A

e

= B and a computable

function h(x) such that the use ϕ

A

e

(x) ≤ h(x).

(ii) A set B is identity bounded Turing reducible to A (B ≤

ibT

A) if B ≤

bT

A

with h(x) = x.

The bT and ibT reductions occur naturally in several parts of the subject.

For example, often we are given a noncomputable c.e. set A and we construct

a simple set B ≤

T

A by simple permitting where an element x is allowed to

enter B at stage some stage only if some y ≤ x has just entered A. When

Ax has settled then Bx has settled also, and hence B ≤

ibT

A.

More recently, ibT has occurred in applications of computability to dif-

ferential geometry in Soare [2004] and Csima-Soare [ta], as described later,

and ibT reducibility has also been used in applications to algorithmic ran-

domness and Kolmogorov complexity. Barmpalias and Lewis [ta] have shown

the nondensity of the ibT-degrees of c.e. sets.

8.3 Truth-Table Reductions

Deﬁnition 8.2. A set B is truth-table reducible to set a A (B ≤

tt

A) if

B ≤

bT

A via Φ

A

e

= B and h(x) as in Deﬁnition 8.1, and also

(14) (∀x)(∀σ)[ [σ[ = h(x) =⇒ Φ

σ

e

(x)↓ ].

Theorem 8.3. [Truth-Table Theorem, Nerode]. The following deﬁ-

nitions of tt-reducible are equivalent.

(i) B ≤

tt

A as deﬁned in Deﬁnition 8.2 and (14).

(ii) Φ

A

e

= B for some total Φ

X

e

that is (∀X)(∃Y )(∀x)[ Φ

X

e

(x) = Y (x) ].

37

(iii) B ≤

tt

A via Φ

A

e

and h(x) as in Deﬁnition 8.2. In addition, there is a

computable function g(x) such that

D

g(x)

= ¦ y : [σ

y

[ = h(x) & Φ

σy

e

(x) = 1 ¦.

(iv) There exist computable functions g and h such that, for all x,

x ∈ B ⇐⇒ (∃z ∈ D

g(x

) [ A(h(x) + 1) = D

z

].

Proof. The implications (i) =⇒ (ii), (iii) =⇒ (i), and (iii) ⇐⇒ (iv) are

obvious. It remains to prove (ii) =⇒ (iii).

(ii) =⇒ (iii). Uniformly in x we can eﬀectively enumerate the set

U

x

= ¦ σ : Φ

σ

e

(x)↓ ¦.

Since Φ

e

is total apply the Compactness Theorem 7.4 (iv) to get a ﬁnite

subset V

x

⊆ U

x

such that ∪¦ ^

σ

: σ ∈ V

x

¦ ⊇ 2

ω

. Deﬁne h(x) and g(x) by

h(x) = max¦ [σ[ : σ ∈ V

x

¦.

D

g(x)

= ¦ y : [σ

y

[ = h(x) & Φ

σy

e

(x) = 1 ¦.

Remark 8.4. Post [1944, '6] introduced the ﬁrst deﬁnition of B ≤

tt

A.

For every integer n he required a eﬀective procedure to produce integers

k, and m

1

, m

2

. . . m

k

. He then drew a diagram of a matrix with columns

m

1

, . . . , m

k

and 2

k

rows with individual entries of + for x ∈ A and − for

x / ∈ A. Letting h(x) be the maximum of the ¦m

i

¦

i≤k

, ﬁlling in all columns

less than h(x), and replacing + by 1 and − by 0 we have exactly the matrix

M

x

described in '8.1. Next Post drew a vertical line to the right of this

matrix and added an extra column such that an entry v

z

in this column

following row R

z

indicated that if A satisﬁes row R

z

then x ∈ B iﬀ v

z

= +.

Post’s extra column converted the matrix M

x

into a total reduction

because A had to extend exactly one of the rows R

z

and then the value

for B(x) was completely speciﬁed by v

z

given in advance. Therefore, Post’s

original deﬁnition [1944] of B ≤

tt

A is virtually identical in intuition and

description to our Deﬁnition 8.2 above where we could attach to matrix

M

x

an extra column with the value Φ

σ

e

(x) on row σ. In both cases the

crucial point is that Φ

σ

e

(x) is deﬁned for every string of length h(x) before

examining the oracle A. Property (iv) of B ≤

tt

A has been used in the

38

past e.g., Soare [1987, p. 83] and is short and slick but is does not give the

necessary elegance and intuition for beginning students.

Turing reducibility was not well understood in 1944 and an understand-

ing of it in its modern state emerged only gradually during the 1940’s and

1950’s. Post’s tt-reducibility in 1944 was understood at once. Therefore,

in 1959 Friedberg and Rogers introduced wtt-reducibility (B ≤

wtt

A) as

a weakening of tt-reducibility which was already a strengthening of ≤

T

.

Therefore, the concept of wtt has distance two from the central concept ≤

T

.

The concept of bounded Turing reducibility (bT), which has the same deﬁni-

tion as wtt, goes immediately to the main concept of bounding the queried

information by a computable function h(x). Thus, ≤

bT

has distance one

from the main reducibility of ≤

T

. The concept of tt-reducibility is tied to

the totality of the reduction Φ

A

e

which is exactly what bT-reducibility lacks.

Also bT is more recognizable than wtt whose meaning cannot be guessed

from its name.

8.4 Diﬀerence of c.e. sets, n-c.e., and ω-c.e. sets

The Limit Lemma characterized sets A ≤

T

∅

**as those such that A = lim
**

s

A

s

for a computable sequence ¦A

s

¦

s∈ω

. Now consider special cases based upon

how many times the approximation changes on x. These notions are more

general than c.e. sets A but not the most general case of A ≤

T

∅

.

Deﬁnition 8.5. (i) A set D is the diﬀerence of c.e. sets (d.c.e.) if D = A−B

where A and B are c.e. sets.

(ii) The set A is omega-c.e. (written ω-c.e.) if there is a computable sequence

¦A

s

¦

s∈ω

with A

0

= ∅ and a computable function g(x) which bounds the

number of changes in the approximation ¦A

s

¦

s∈ω

in the following sense,

(15) A = lim

s

A

s

& [ ¦ s : A

s

(x) = A

s+1

(x) ¦ [ ≤ g(x).

(iii) For n ∈ ω the set A is n-c.e. if g(x) ≤ n.

For example, the only 0-c.e. set is ∅, the 1-c.e. sets are the usual c.e. sets,

and the 2-c.e. sets are the d.c.e. sets. The next theorem gives an elegant

characterization of ω-c.e. sets.

Theorem 8.6. The following are equivalent.

(i) A ≤

bT

∅

.

(ii) A is ω-c.e.

(iii) A ≤

tt

∅

.

39

Proof. Clearly, (iii) implies (i).

(i) =⇒ (ii). Suppose Φ

∅

e

= A with computable bound g(x) ≥ ϕ

∅

e

(x). Let

A

s

(x) = Φ

∅

e

(x)[ s ] where we may speed up the computation so the latter is

always deﬁned. Now A

s+1

(x) = A

s

(x) only if some element z ≤ g(x) enters

∅

**which can happen at most g(x) + 1 times, once for each z ∈ [0, g(x)].
**

(ii) =⇒ (iii). Assume A = lim

s

A

s

satisﬁes (15) via g(x). Deﬁne the c.e.

change set C by

C = ¦ 'k, x` : 1 < k ≤ [ ¦s : A

s

(x) = A

s+1

(x)¦ [ ¦.

(Intuitively, whenever A

s

(x) = A

s+1

(x) we put into C the least element

of the form 'k, x`, i.e., on row ω

[x]

, not already in C.) Therefore, [C

[x]

[ is

the number of changes on x during the approximation, and [C

[x]

[ ≤ g(x)

by hypothesis (ii). Furthermore, A(x) = 1 iﬀ [C

[x]

[ is odd, because the

approximation changes between 0 and 1 starting with 0.

First build a truth-table to demonstrate that A ≤

tt

C. For a given x

the truth-table has rows of width g(x) as in Deﬁnition 8.2 (ii). For each

k ≤ g(x) construct a row beginning with k many 1

s followed by all 0

s.

Now to tt-compute from C whether x ∈ A compute k = [C

x

[. Next ﬁnd the

row with k many 1’s. Now A(x) = 1 iﬀ k is odd. Hence, A ≤

tt

C. However,

C is c.e. Hence, C ≤

m

0

and therefore A ≤

tt

0

.

This result shows the diﬀerence between T-reductions and tt-reductions.

First, the assumption on h(x) ensures that A ≤

bT

D. Second, the approx-

imation always begins with A

s

(x) = 0 for s = 0 and changes between 0

and 1 because all values are in ¦0, 1¦ rather than in ω. Therefore, we can

make up a row in the truth-table which gives value for A(x) based only on

the number of changes. This ensures that A ≤

tt

D. This case is unusual

since most reductions we consider only produce A ≤

T

B for some set B and

sometimes produce A ≤

bT

B as in permitting arguments.

9 Online Computing

The original implementations of computing devices were generally oﬄine

devices such as calculators or batch processing devices. However, in recent

years the implementations have been increasingly online computing devices

which can access or interact with some external database or other device.

The Turing o-machine is a better model to study them because the Turing

a-machine lacks this online capacity.

40

Deﬁnition 9.1. (i) An online or interactive computing process is one which

interacts with its environment, for example a computer communicating with

an external data base such at the World Wide Web.

(ii) An oﬄine computing process is one which begins with a program and

input data, and proceeds internally, not interacting with any external device.

This includes a calculator, and batch processing devices where a user handed

a deck of punched IBM cards to an operator, who fed them to the computer

and produced paper output later.

There are many descriptions in the computing literature about online

and interactive processes. In [Goldin-Smolka-Wegner] a chapter by Yuri

Gurevich, Interactive Algorithms 2005 is described,

“In this chapter, Gurevich asserts that computer science is largely

about algorithms, and broadens the notion of algorithms to in-

clude interaction by allowing intra-step interaction of an algo-

rithm with its environment.”

About the chapter, A Theory of Interactive Computation by Jan van

Leeuwen and Jiri Wiedermann, the book states,

“This chapter asks what a computational theory of interactive,

evolving programs should look like. The authors point out that a

theory of interactive computation must necessarily lead beyond

the classical, ﬁnitary models of computation. A simple model of

interactive computing is presented consisting of one component

and an environment, interacting using single streams of input

and output signals.”

It appears that the Turing o-machine is a good theoretical model to

analyze an interactive process because there is usually a ﬁxed algorithm

or procedure at the core, which by Turing’s thesis we can identify with a

Turing a-machine, and there is a mechanism for the process to communicate

with its environment, which when coded into integers may be regarded as

a Turing type oracle. Under the Post-Turing Thesis 6.1 these real world

online or interactive processes can be described by a Turing oracle machine.

In real world computing the oracle may be called a database or an en-

vironment. A laptop obtaining data from the World Wide Web is a good

example. In the real world the database would not be literally inﬁnite but

may appear so (like the web) and is usually too large to be conveniently

downloaded into the local computer. Sometimes the local computer is called

the “client” and the remote device the “server.”

41

9.1 Turing Machines and Online Processes

We could continue analyzing to what extent Turing oracle machines can

model modern online processes, but let us now examine the reverse direction,

that o-machines are online while a-machines are not. The following points

appear self-evident.

• Turing oracle machines are online. An o-machine has ﬁxed program

but has the capacity to interact with its environment and receive new

data during its computation.

• The original Turing a-machines are not online. A Turing a-machine,

even a universal machine, begins with a ﬁxed program and ﬁxed input

and proceeds without further outside input until (if ever) it halts.

• A large number and rapidly increasing number of computing processes

in the real world are online or interactive. See the authors in [Goldin-

Smolka-Wegner] for only a few.

• A large number of books presenting an introduction to computability

mention Turing oracle machines and relative computability very late

in the book or not at all.

• A large number of books with articles on Turing and the Church-

Turing Thesis do not mention Turing oracle machines or relative com-

putability at all, e.g., Christof Teuscher [2004].

Discussing only Turing a-machines in modern texts, or only the Church-

Turing Thesis, and not the Post-Turing Thesis on oracle computers, is like

discussing only batch processing machines of the 1950’s long after the emer-

gence of online computing.

9.2 Trial and Error Computing

We expect Turing a-machines and o-machines to be absolutely correct. How-

ever, there are many computing processes in the real world which give a se-

quence of approximations to the ﬁnal answer. Turing considered machines

which make mistakes. In his talk to the London Mathematical Society,

February 20, 1947, quoted in Hodges, p. 360–361, Turing said,

“I would say that fair play must be given to the machine. Instead

of it sometimes giving no answer we could arrange that it gives

42

occasional wrong answers. But the human mathematician would

likewise make blunders when trying out new techniques. It is

easy for us to regard these blunders as not counting and give him

another chance, but the machine would probably be allowed no

mercy. In other words if a machine is expected to be infallible, it

cannot also be intelligent. There are several theorems which say

exactly that. But these theorems say nothing about how much

intelligence may be displayed if a machine makes no pretence at

infallibility.

Hillary Putnam [1965] described trial and error predicates as ones for

which there is a computable function which arrives at the correct answer

after a ﬁnite number of mistakes. In modern terminology this is called

a limit computable function as described in Soare [1987] or Soare [CTA]

Chapter 3. This is a model for many processes in the real world which allow

ﬁnitely many mistakes but gradually move closer to the correct answer.

9.3 The Limit Lemma

There are several diﬀerent approaches for computing with ﬁnite errors.

Deﬁnition 9.2. A computable sequence of computable sets ¦B

s

¦

s∈ω

is a

computable (∆

0

) approximating sequence for a set B if B = lim

s

B

s

. If there

is such a sequence we say that B is limit computable,

Lemma 9.3. [Limit Lemma, Shoenﬁeld, 1959]. The following are

equivalent.

(i) B ≤

T

A for some c.e. “oracle set” A.

(ii) B is limit computable.

(iii) B ∈ ∆

2

, that is, B is is both two quantiﬁer forms.

Proof. (See Soare [1987] or Soare [CTA] Lemma 3.3.6.)

Now in the real world imagine an example of a computing process with

error such as: a robot learning a maze; a ﬁnancial trader receiving informa-

tion from around the world updated every second; a meteorologist predicting

the weather a week from now given constantly updated weather conditions

today. In our idealized model we assume that the individual makes ﬁnitely

many errors during the process ¦B

t

¦

t∈T

for time periods t ∈ T but even-

tually gets the correct answer. (In practice, the ﬁnal answer may not be

43

exactly correct in these examples, but is presumably more accurate than

the ﬁrst approximation B

0

. The sequences of improving approximations,

even if not exact, are usually useful in ﬁnancial trading, meteorology, and

other approximations in real time.)

9.4 Two Models for Computing With Error

9.4.1 The Limit Computable Model

In the limit computable or approximation model we have a sequence of

Turing programs ¦P

t

: t ∈ T¦ so that P

t

computes function g

t

at time t ∈ T.

There is not necessarily any connection between diﬀerent programs and we

may have to compute all over again with a new program as we pass from

time t to t + 1.

Suppose the ﬁnancial trader in Chicago receives data every second t ∈ T

about currency prices in London, Milan, New York and Tokyo. The conﬁg-

uration at his trading desk may be described using the Limit Lemma by a

computable function where g

t

is the computable characteristic function of

B

t

, the conﬁguration of his computation at the end of time t. The com-

putable function g

t

gives an algorithm to compute the condition B

t

at time

t but it gives no relationship between B

t

and B

t+1

. It will not be possible

for the trader to write a new program every second. How will the trader

write a program to uniformly compute the index g

t

for t ∈ T?

9.4.2 The Online Model

By the Limit Lemma there is a c.e. set A (or even a ∆

0

2

set) and oracle

machine Φ

e

such that B = Φ

A

e

. Now the trader can program the algorithm

Φ

e

into his laptop once and for all at the start of the trading day. Every

second t ∈ T he receives from New York and abroad the latest quotes A

t

which enter directly into his computer by an internet connection. He does

not (and cannot) change the program Φ

e

every second. His algorithm simply

receives the “oracle” information A

t

from the internet as it is continually

updated, and computes the approximation B

t

(x) = Φ

At

e

(x). His program

then executes a trade when the algorithm determines that conditions are

favorable. It is diﬃcult to see how this trader could have carried out his

business using a batch processing, Turing a-machine model, instead of an

online model.

44

10 Three Displacements in Computability Theory

The dictionary deﬁnes “displacement” to be the moving of something from

its rightful place or position, often when replaced by something else. There

are three important issues in computability which have at one time been

displaced from their correct or proper positions as evaluated by historical

and scientiﬁc criteria. These issues are at the very heart of the subject

and they deﬁne how we think about computability. We now examine these

three issues one by one in the next three sections. These items may have

been displaced accidentally or without conscious thought or decision, simply

acting from the exigencies of the situation at the time, but are not consistent

with a careful scientiﬁc analysis later.

When computabiliy theory originated in the 1930’s it was a very small

ﬁeld attempting to consolidate its ideas. Furthermore, three of its leaders,

G¨odel, Turing, and Church eﬀectively left the ﬁeld after 1940 and had little

direct inﬂuence thereafter on its development, although Church supervised

the Ph.D. theses of many prominent researchers in the ﬁeld. After 1940

the ﬁeld was developed and promulgated primarily by Stephen C. Kleene

with some additional inﬂuence by Emil Post as described earlier. In dedicat-

ing his book Degrees of Unsolvability [1971] Shoenﬁeld recognized Kleene’s

overwhelming inﬂuence,

“Dedicated to S.C. Kleene who made recursive function theory

into a theory.”

This is entirely accurate and without Kleene’s leadership we would not have

the ﬁeld as we know it today. However, a number of changes took place after

1940, perhaps by accident, that were not consistent with the original devel-

opment of computability in the 1930’s and would not have been approved

of by G¨odel and Turing.

11 “Computable” versus “Recursive”

Starting in 1936, Church and Kleene used the term “recursive” to mean

“computable” even though Turing and G¨odel later objected. Kleene later

introduced the term “recursive function theory” for the subject although

G¨odel disagreed (see below). This was the ﬁrst time in history that the

term “recursive” which had meant roughly “inductive” acquired the addi-

tional meaning “computable” of “calculable.” After 1996 the term the term

‘recursive” was again used only to mean “inductive” not “computable” or

45

“calculable.” From 1931 to 1934 Church and Kleene had used the λ-deﬁnable

functions as the formal equivalent of eﬀectively calculable functions, and

Church had ﬁrst proposed his thesis privately to G¨odel in that form.

11.1 Church Defends Church’s Thesis with “Recursive”

Recall Church’s Thesis 2.1 (First Version) [1934] “A function is eﬀectively

calculable if and only if it is λ-deﬁnable.” When G¨odel strongly rejected to

this thesis Church turned instead to G¨odel’s own Herbrand-G¨odel general

recursive functions as a formalism and proposed in [1935] and [1936] the

well-known form of his thesis, Church’s Thesis 2.2 [1936] A function on the

positive integers is eﬀectively calculable if and only if it is recursive.

Church and Kleene knew almost immediately and published by 1936

the proof of the formal equivalence of recursive functions with λ-deﬁnable

functions. After seeing G¨odel’s lectures in 1934 Church and Kleene dropped

the λ-deﬁnable functions and adopted the recursive functions. This was

not because of the inadequacy of λ-deﬁnable functions in comparison to the

recursive functions. Indeed Church seems to have preferred the λ-deﬁnable

functions and caused Turing to write his thesis [1939] in that formalism.

Church was very eager for mathematicians to accept his thesis and he

know that the recursive functions were more familiar to a mathematical au-

dience than λ-deﬁnable ones. Church and Kleene used the second version

of Church’s Thesis above, phrased in terms of recursive functions primarily

for public relations as Kleene [1981] explained, “I myself, perhaps unduly

inﬂuenced by rather chilly receptions from audiences around 1933–35 to dis-

quisitions on λ-deﬁnability, chose, after general recursiveness had appeared,

to put my work in that format. . . . ” Church and Kleene were simply doing

what most scientists do, arrange the work in a framework which will be

understandable and appealing to as large a scientiﬁc audience as possible.

Ironically, this is exactly what caused the change in 1996 from “recursive”

back to “computable” because in 1996 the term “computable” was much

better understood by a general audience than “recursive.” The irony is that

the term “computable” was there all along and was preferred by Turing and

G¨odel.

11.2 Church and Kleene Deﬁne “Recursive” as “Computable”

By 1936 Kleene and Church had begun thinking of the word “recursive”

to mean “computable.” Church had seen his ﬁrst thesis rejected by G¨odel

and was heavily invested in the acceptance of his 1936 thesis in terms of

46

recursive functions. Without the acceptance of this thesis Church had no

unsolvable problem. Church wrote in [1936, p. 96] printed in Davis [1965]

that a “recursively enumerable set” is one which is the range of a recursive

function. This is apparently the ﬁrst appearance of the term “recursively

enumerable” in the literature and the ﬁrst appearance of “recursively” as

an adverb meaning “eﬀectively” or “computably.”

In the same year Kleene [1936, p. 238] cited in Davis [1965] [p. 238]

mentioned a “recursive enumeration” and noted that there is no recursive

enumeration of Herbrand-G¨odel systems of equations which gives only the

systems which deﬁne the (total) recursive functions. By a “recursive enu-

meration” Kleene states that he means “a recursive sequence (i.e., the suc-

cessive values of a recursive function of one variable).” Post [1944], under

the inﬂuence of Church and Kleene, adopted this terminology of “recursive”

and “recursively enumerable” over his own terminology [1943], [1944] of “ef-

fectively generated set,” “normal set,” “generated set.” Thereafter, it was

ﬁrmly established.

11.3 G¨ odel Rejects “Recursive Function Theory”

Neither Turing nor G¨odel ever used the word “recursive” to mean “com-

putable.” G¨odel never used the term “recursive function theory” to name

the subject; when others did G¨odel reacted sharply negatively, as related by

Martin Davis.

In a discussion with G¨odel at the Institute for Advanced Study in

Princeton about 1952–54, Martin Davis casually used the term

“recursive function theory” as it was used then. Davis related,

“To my surprise, G¨odel reacted sharply, saying that the term in

question should be used with reference to the kind of work Rosza

Peter did.”

(See Peter’s work on recursions in [1934] and[1951].) By 1990 the situation

had become very diﬃcult. Most people access to a personal computer on

their desks and the terms of computing were familiar to the general popula-

tion but “recursive” was limited to very small number who mainly associated

it with a ﬁrst year programming course or a deﬁnition by induction on math-

ematics and almost never with computability. So few people understood the

meaning of “recursive” that by 1990 I had to begin my papers with,

“Let f be a recursive function (that is, a computable function),”

as if I were writing in Chinese and translating back into English.

47

11.4 The Ambiguity in the Term “Recursive”

The traditional meaning of “recursive” as “inductive” led to ambiguity.

Kleene often wrote of calculation and algorithms dating back to the Baby-

lonians, the Greeks and other early civilizations. However, Kleene [1981b,

p. 44] wrote,

“I think we can say that recursive function theory was born

there ninety-two years ago with Dedekind’s Theorem 126 (‘Satz

der Deﬁnition durch Induktion’) that functions can be deﬁned

by primitive recursion.”

Did he mean that recursion and inductive deﬁnition began with Dedekind or

that computability and algorithms began there? The latter would contradict

his several other statements, such as Kleene [1988, p. 19] where he wrote,

“The recognition of algorithms goes back at least to Euclid (c. 330 B.C.).”

When one uses a term like “recursive” to also mean “computable” or “algo-

rithmic” as Kleene did, then one is never sure whether a particular instance

means “calculable” or “inductive” and our language has become indistinct.

Returning “recursive” to its original meaning of “inductive” has made its

use much clearer. We do not need another word to mean “computable.” We

already have one.

11.5 Changing “Recursive” Back to “Inductive”

By 1996 the confusion had become intolerable. I wrote an article on Com-

putability and Recursion for the Bulletin of Symbolic Logic [1996] on the

history and scientiﬁc reasons for why we should use “computable” and not

“recursive” to mean “calculable.” “Recursive” should mean “inductive” as

is had for Dedekind and Hilbert. At ﬁrst few were willing to make such a

dramatic change, overturning a sixty year old tradition of Kleene, and the

words “computability theory” and “computably enumerable (c.e.) set” did

not come tripping from the lips. However, in a few months more people

were convinced by the undeniable logic of the situation. Three years later

at the A.M.S. conference in Boulder, Colorado referenced in Soare [2000],

most researchers, especially those under forty years old, had adopted the

new terminology and conventions. Changing back from from “recursive” to

“computable” during 1996–1999 has had a number of advantages.

Historical Accuracy. The founders of the two key models of com-

putabilty, Turing and G¨odel, had never used “recursive” to mean com-

putable and indeed had objected when it was so used. The object of

48

everyone was to formally capture the informal concept of “eﬀectively

calculable” which Turing machines did to G¨odel’s satisfaction, while

at ﬁrst G¨odel’s own model of Herbrand-G¨odel recursive functions did

not. The object was never to understand the notion of recursions

or inductive deﬁnitions. In 1935 Church adopted G¨odel’s recursive

functions as a deﬁnition of eﬀectively calculable before seeing Turing

machines As Kleene relates, Church and Kleene did this as a matter

of public relations to relate to a concept mathematicians could under-

stand, not in an attempt to better understand the nature of recursion

and inductive deﬁnition.

Scientiﬁc Accuracy. The words “calculate” and “compute” are very

close in the dictionary, the former being a bit more general. The

word “recursive” means a procedure characterized by recurrence or

repetition from the Latin verb “recurrere,” to run back. The word

has nothing to do with “calculate” or “compute.” The general public

understands the ﬁrst two words in this context. To the extent that they

have any idea about “recursive” they understand it in this context.

For example, a ﬁrst year programming course speaks of deﬁnition by

iteration versus deﬁnition by recursion.

Name Recognition. Suppose a student is scanning a catalogue for a

course to take and sees the course title “Recursive Function Theory”

versus “Computability Theory.” Which will give him more information

about the content of the course? Should a fresh Ph.D. apply for jobs

under the general area of his work as the ﬁrst or second? Should a

professor write an abstract for his lecture at another university under

the ﬁrst title or second?

Names do matter. They mattered to Church and Kleene in 1936 when

they changed from the term “λ-deﬁnable function” to “recursive function”

to achieve greater name recognition among mathematicians and to make

Church’s Thesis more convincing before the appearance of Turing. Names

matter today as we try to relate our specialty of computability to the world

of computers and algorithmic procedures all around us, a world partially

created by Turing.

49

12 Renaming it the “Computability Thesis?”

12.1 Kleene Called it “Thesis I” in [1943]

In the 1930’s both Church and Turing thought they were giving deﬁnitions

of an eﬀectively calculable function, not putting forth a “thesis.” These were

not even called “theses” at all until Kleene [1943, p. 60] referred to Church’s

“deﬁnition” as “Thesis I.”

12.2 Kleene Named it “Church’s thesis” in [1952]

Later in his very inﬂuential book [1952] it is fascinating to see how Kleene’s

thinking and terminology progressed from “Thesis I” to “Church’s Thesis”

and not to “Turing’s Thesis” or the “Church-Turing Thesis.” Kleene [1952,

p. 300] took up where Kleene [1943] had left oﬀ.

“This heuristic evidence and other considerations led Church

1936 to propose the following thesis.

Thesis I. Every eﬀectively calculable function (eﬀectively decid-

able predicate) is general recursive.”

This is identical with what we previously called Church’s Thesis 2.2. Of

course, Kleene was aware of other similar “theses” advanced nearly simul-

taneously and he continued [1952, p.300],

“This thesis is also implicit in the conception of a computing

machine formulated by Turing 1936–7 and Post 1936.”

Next Kleene begins a subtle shift of terminology from “Thesis I” to

“Church’s thesis.” Apparently he did not feel it necessary to include Turing’s

name when he used the term “Church’s thesis.” Kleene wrote [1952, p.317]

began a new section '62 and called it “Church’s thesis” instead of “Thesis I”

as he had been doing. Kleene wrote,

“ '62. Church’s thesis. One of the main objectives of this and

the next chapter is to present the evidence for Church’s thesis

(Thesis I) '60.”

50

12.3 Kleene Dropped “Thesis I” for “Church’s thesis”

As Kleene progressed through [1952, '62, pp. 318–319] he dropped any ref-

erence to “Thesis I” and used only “Church’s thesis” with no mention of

Turing or Post in the thesis. He wrote [1952, p. 318–319],

“ Church’s thesis, by supplying a precise delimitation of all ef-

fectively calculable functions, . . . ”

“While we cannot prove Church’s thesis, since its role is to de-

limit precisely an hitherto vaguely conceived totality, we require

evidence that it cannot conﬂict with the intuitive notion which

it is supposed to complete; . . . ”

“The converse of Church’s thesis, i.e., that every general recur-

sive function ϕ is eﬀectively calculable, we take to be already

conﬁrmed by the intuitive notion (cf. '60).”

12.4 Evidence for the Computability Thesis

In one of the most familiar parts of the book, Kleene summarized the ev-

idence for “Church’s thesis” in [1952, '62, p. 319]. These arguments have

been cited in hundreds of computability books and papers for the last half

century. After some heuristic evidence in (A), Kleene presented perhaps

the most powerful evidence, the “(B) Equivalence of diverse formulations:”

such as the (Herbrand-G¨odel) general recursive functions, λ-deﬁnable func-

tions, Turing computable functions, and systems of Post [1943] and [1946] of

canonical and normal systems. Ironically, to clinch the evidence for Church’s

thesis Kleene began a new part (C) where he appealed to Turing’s work and

wrote,

“(C) Turing’s Concept of a Computing Machine.”

Turing’s computable functions [1936–7] are those which can be

computed by a machine of a kind which is designed, according

to his analysis, to reproduce all sorts of operations which a hu-

man computer could perform, working according to preassigned

instructions. Turing’s notion is thus the result of a direct at-

tempt to formulate mathematically the notion of eﬀective calcu-

lability, while other notions arose diﬀerently and were afterwards

identiﬁed with eﬀective calculability. Turing’s formulation hence

constitutes an independent statement of Church’s thesis.”

51

We see here the amalgamation of diﬀerent meanings into a single term

(just as for “recursive” above). Kleene here was using the term “Church’s

thesis” to include Turing’s Thesis and Turing’s justiﬁcation. Turing’s work

was to establish the connection between eﬀectively calculable functions and

Turing computable functions in Turing’s Thesis 3.1. As an intensional

claim it had nothing to do with the recursive functions of Church’s The-

sis 2.2. It was only the equivalence of Turing computable functions ﬁrst

with λ-deﬁnable functions and hence with recursive functions which links

them extensionally but not intensionally.

Remark 12.1. [The Computability Thesis Emerges]. It is exactly

here that Kleene introduces (without explicit mention) another convention

and term which has lasted until today. Kleene knows that the various for-

mal deﬁnitions all coincide extensionally, and he regards them interchange-

ably, regardless of their intensional or historical import. From now on when

Kleene uses the term “Church’s thesis” he means the following “Computabil-

ity Thesis.” Kleene omits Turing’s name from the thesis even though in part

(C) above he gave Turing credit as the only one who made a “direct attempt

to formulate mathematically the notion of eﬀective calculability.”

Deﬁnition 12.2. [The Computability Thesis]. A function on the pos-

itive integers is eﬀectively calculable if and only if it is recursive or Turing

computable, or deﬁned by any of the other formalisms.

Note that the Computability Thesis is essentially the same as what we

have called the Church-Turing Thesis 3.2. It does not refer to one single man

or to one single formalism. The Computability Thesis, used extensively in

the subject, is usually listed under the name “Church’s Thesis” as in the

title of the new book [Olszewski, 2007] with no mention of Turing. Many

people today use “Church’s Thesis” in this way.

12.5 Who First Demonstrated the Computability Thesis?

Demonstrating something like the Computability Thesis requires two steps.

The Formalism. A formal mathematical deﬁnition for eﬀectively calcula-

ble functions. Church [1936] proposed G¨odel’s general recursive func-

tions [1934]. Turing invented the new formalism of Turing machines

because this was closest to his idea of a mechanical process and be-

cause it lent itself to proving that any eﬀectively calculable function

lay in this class.

52

The Demonstration. The second and perhaps more important step is to

prove that the informal notion of a person calculating a function can be

simulated by the formal model. This step is not a purely mathematical

one but it needs to be as convincing and logical as possible. We refer

to this step as a “demonstration” rather than a formal “proof.”

Although it is not a formal proof, this second step is so crucial that it has

been referred to as a “theorem” by Gandy and others. Gandy [1988, p. 82]

observed, “Turing’s analysis does much more than provide an argument for

‘Turing’s Thesis,’ it proves a theorem.”

3

Furthermore, as Gandy [1988,

pp. 83–84] pointed out, “Turing’s analysis makes no reference whatsoever to

calculating machines. Turing machines appear as a result, a codiﬁcation, of

his analysis of calculations by humans.” Turing’s Thesis [1936, '9] stated

in Deﬁnition 3.1 is that every intuitively computable (eﬀectively calculable)

function is computable by a Turing machine.

In contrast, Church used the Herbrand-G¨odel general recursive functions

as his formal model but even their inventor, G¨odel, was not convinced as

we have seen in '2 and '3. No modern book uses the H-G general recursive

formalism to deﬁne the eﬀectively calculable functions.

A considerably more serious objection is that there was a ﬂaw in Church’s

demonstration that every eﬀectively calculable function is general recursive.

The ﬂaw in Church’s argument [1936, '7] for his thesis was this. Church

began by deﬁning an “eﬀectively calculable” function to be one for which

“there exists an algorithm for the calculation of its values.” Church analyzed

the informal notion of the calculation of a value f(n) = m according to a

step-by-step approach (so called by Gandy [1988, p. 77]) from two points of

view, ﬁrst by an application of an algorithm, and second as the derivation in

some formal system, because as he pointed out, G¨odel had shown that the

steps in his formal system P were primitive recursive. Following Davis [1958,

p. 64] or Shoenﬁeld [1967, pp. 120–121] it is reasonable to suppose that the

calculation of f proceeds by writing expressions on a sheet of paper, and

that the expressions have been given code numbers, c

0

, c

1

, . . . c

n

. Deﬁne

'c

0

, c

1

, . . . c

n

` = p

c

0

0

p

c

1

1

. . . p

cn

n

. We say that the calculation is stepwise

recursive if there is a partial recursive function ψ such that ψ('c

0

, . . . , c

i

`) =

c

i+1

for all i, 0 ≤ i < n.

3

Gandy actually wrote “Church’s thesis” not “Turing’s thesis” as written here, but

surely Gandy meant Turing’s Thesis, i.e., the computability thesis, at least intensionally,

because Turing did not prove anything in [1936] or anywhere else about general recursive

functions.

53

If the basic steps are stepwise recursive, then it follows easily by the

Kleene Normal Form Theorem which Kleene had proved and communicated

to G¨odel before November, 1935 (see Kleene [1987b, p. 57]), that the entire

process is µ-recursive. The fatal weakness in Church’s argument was the

core assumption that the atomic steps were stepwise recursive, something

he did not justify. Gandy [1988, p. 79] and especially Sieg [1994, pp. 80, 87],

in their excellent analyses, brought out this weakness in Church’s argument.

Sieg [p. 80] wrote, “. . . this core does not provide a convincing analysis:

steps taken in a calculus must be of a restricted character and they are

assumed, for example by Church, without argument to be recursive.” Sieg

[p. 78] wrote, “It is precisely here that we encounter the major stumbling

block for Church’s analysis, and that stumbling block was quite clearly seen

by Church,” who wrote that without this assumption it is diﬃcult to see

how the notion of a system of logic can be given any exact meaning at all.

It is exactly this stumbling block which Turing overcame by a totally new

approach.

12.6 The Computability Thesis and the Calculus

Why all the fuss over names? Why not simply use the term “Church’s

Thesis” invented by Kleene [1952], and let it refer to the “Computability

Thesis?” This is in fact what is widely (and incorrectly) done.

If we had to attach a single name to “the calculus” every time we men-

tioned it, whose name should it be? Isaac Newton began working on a form

of the calculus in 1666 but did not publish it until much later. Gottfried

Leibniz began work on the calculus in 1674 and published his account of the

diﬀerential calculus in 1684 and the integral calculus in 1686. Newton did

not publish it until 1687 although most believe he had been working on it

before Leibniz began in 1674. There was a great controversy about priority

up until Leibniz’s death in 1716. The British Royal Society handed down

a verdict in 1715 crediting Isaac Newton with the discovery of the calculus,

and stating that Leibniz was guilty of plagarism (although these charges

were later proved false). Newton was more established than Leibniz and

had vigorous supporters. Newton and his followers campaigned vigorously

for his position. The Wiki encylopedia wrote,

“Despite this ruling of the Royal Society, mathematics through-

out the eighteenth century was typiﬁed by an elaboration of the

diﬀerential and integral calculus in which mathematicians gen-

erally discarded Newton’s ﬂuxional calculus in favor of the new

methods presented by Leibniz.”

54

12.7 Founders of Computability and the Calculus

There is a parallel between the development of the Calculus and the demon-

stration of the Computability Thesis.

1. Church and Turing both worked independently on it and came up with

diﬀerent models.

2. Turing began slightly later than Church. Leibnitz began later than

Newton. Both Leibniz and Turing worked at a distance and indepen-

dently of Newton and Church, respectively, unaware of the work by

another researcher.

3. Turing’s model of Turing machines is overwhelmingly more appealing

and popular that Church’s model of the (Herbrand-G¨odel) general

recursive functions, a model which is rarely presented in any books

and never used for actual calculations in any courses. The general

recursive functions are used only in an historical discussion. (This

refers to the Herbrand-G¨odel general recursive functions. The Kleene

µ-recursive functions have other uses but are were not mentioned in

the original Church’s Thesis 2.2.)

4. For the calculus, despite the Royal Society ruling, “mathematicians

generally discarded Newton’s ﬂuxional calculus in favor of the new

methods presented by Liebniz.”

5. In computer science, the Turing machines (and other calculating ma-

chines like register machines) dominate. The general recursive func-

tions are never seen. Kleene’s µ-recursive functions are sometimes

used in courses and mistakenly called recursive functions but to prove

that an eﬀectively calculable function is µ-recursive requires a tedious

arithmetization as in G¨odel’s incompleteness theorem [1931] and is

virtually never done.

6. Newton was in the position of power with the Royal Society which

not only aﬃrmed his claim but denied the claim by his rival Leibniz.

Church was the senior ﬁgure in computability (after G¨odel). Church’s

claim to the Computability Thesis was aﬃrmed by his former Ph.D.

student Stephen Kleene [1952]. Kleene occasionally mentioned Tur-

ing’s Thesis and repeatedly used the Turing machine model and Tur-

ing’s demonstration of its success to demonstrate the Computability

Thesis. However, Kleene deliberately and overwhelmingly established

55

the phrase “Church’s thesis” to stand for the “Computability Thesis, ”

at a time when nobody called it a thesis and when the ﬁeld was about

to rapidly expand in the 1950’s and 1960’s and would turn to Kleene

for direction as the last representative of the original computability

researchers of the 1930’s and the most prominent and inﬂuential of

all computability theorists in the 1950’s. The Royal Society was not

successful in excluding Leibniz from the calculus, but Kleene was cer-

tainly successful in excluding Turing’s name from the Computability

Thesis.

Virtually all the papers and books including Rogers [1967] and Soare

[1987] and many others followed Kleene’s lead. Unlike the calculus, the

participants, Church, Turing, and their followers, have given credit to the

others. The problem is simply that Kleene has not given Turing credit in

his naming of the Computability Thesis. Kleene could have called it “the

Computability Thesis” analogously with “the calculus.” We never refer to

“the Newton calculus” or the “Leibniz calculus.” Why do we need to give

a person’s name to the Computability Thesis? Kleene never denied credit

to Turing and in many places such as his books [1952] and [1967] he gives

Turing credit for the most intuitive presentation of computability. Kleene

just does not include Turing in the name he chose.

Remark 12.3. Kleene thought and wrote with tokens, words that are given

arbitrary and nonstandard meaning by the author: “recursive” means “com-

putable,” “Church’s Thesis” means the “Computability Thesis.” The arbi-

trary and sometimes misleading use of words has diminished our communi-

cations among ourselves and with other scientiﬁc and scholarly colleagues.

It is ambiguous to use “recursive” with both meanings, inductive and

computable, as we have seen. Second, it is simply wrong to use “Church’s

Thesis” to refer to a proposition ﬁrst demonstrated by Turing and never

successfully demonstrated by Church. It would also be wrong to refer to

“the Newton Calculus” without mentioning Leibniz. Today we refer to “the

calculus” without any founder’s name. Why not call it simply, “the Com-

putability Thesis” and not “Church’s Thesis,” or the “Church-Turing The-

sis?” Which of the three terms is more understandable to an outsider who

has never heard about the subject?

56

13 Turing a-machines versus o-machines?

13.1 Turing, Post, and Kleene on Relative Computability

In '4 we have seen how Turing [1939, '4] brieﬂy introduced an oracle machine

(o-machine) and how and in '5–'7 how Post developed relative computabil-

ity through the inﬂuential Kleene-Post [1954] paper. Kleene [1952, p. 314]

took up the theme of relative computabilty of a function from an oracle

set. Analogous to his version of Thesis I considered above, Kleene deﬁned

Thesis I* to be the corresponding relative computability thesis which we

have called Post-Turing Thesis 6.1. He recommended this thesis but did not

give a separate justiﬁcation. Kleene [1952, p. 314] wrote, “The evidence for

Thesis I will also apply to Thesis I*,” and on [1952, p. 319] he wrote,

“We now summarize the evidence for Church’s Thesis (and The-

sis I*, end '61) under three main headings (A)–(C), and one

other (D) which may be included under (A).”

13.2 Relative Computability Uniﬁes Incomputability

The ﬁeld of computability theory deals mostly with incomputable not com-

putable objects. The objects considered in degrees of unsolvability, in com-

putable model theory, in diﬀerential geometry as in Csima-Soare [2006] or

Soare [2004] all deal with incomputable objects. However, we should not

call the subject “incomputability theory” because the underlying theme is

the notion of relative computability as absolute because of the Oracle Graph

Theorem 4.5, and because it relates and uniﬁes the myriad incomputable

objects.

13.3 The Key Concept of the Subject

The notion of an oracle machine and relative computability is the single

most important in the subject.

1. A Turing a-machine can easily be simulated by a Turing o-machine

and the latter is scarcely more complicated to explain.

2. Most of the objects considered in computability theory and applica-

tions to algebra, model theory, geometry, analysis and other ﬁelds are

incomputable not computable and relative computability uniﬁes them.

57

3. Many if not most computing processes in the real world are online

or interactive processes, better modelled by an o-machine than an

a-machine.

4. A relative computability process Φ

A

e

corresponds to a continuous func-

tional on Cantor space analogous to continuous functions in analysis.

A function on Cantor space given by an a-machine is merely a constant

function.

13.4 When to Introduce Relative Computability

In view of the importance of relative computability, and online computing in

both theoretical results and real world computing it is surprising how many

computability books introduce oracle machines and Turing functionals so

late in the book or not at all. For example, Kleene’s book [1952] was the

ﬁrst real book on computability theory and the principal reference for at

least ﬁfteen years until Rogers [1967] appeared. Kleene introduced relative

computability in Chapter 11 on page 266 by adding the characteristic func-

tion of the oracle set A to the Herbrand-G¨odel general recursive functions.

Rogers [1967] took the Turing machine approach and immediately deﬁned

computability using regular Turing machines (a-machines). Rogers quickly

became the most readable textbook on computability and remains a pop-

ular reference. Rogers introduced relative computability only in Chapter 9

on page 128 using Turing’s original deﬁnition [1939] of an ordinary Turing

machine with the additional capacity to consult an oracle A occasionally

during the computation. In another popular introduction, Computability,

Cutland [1980] introduces relative computability relatively late on page 167.

Boolos and Jeﬀrey in Computability and Logic [1974] do not discuss it at all.

The more recent and very extensive books by Odifreddi, Classical Recursion

Theory Vol. I [1989] and Vol. II [1999] introduce relative computability only

on page 175 by adding the characteristic function of oracle set A to the

Kleene µ-recursive functions. Lerman [1983] deﬁnes relative computability

from an oracle by adding the characteristic function of the oracle to the

Kleene µ-recursive functions. This occurs on page 11 but Lerman is as-

suming that the reader has already mastered a ﬁrst course in computability

using a text such as Rogers [1967]. Cooper’s new book [2004] introduces

oracle Turing machines on page 139.

Kleene’s second and more introductory book, Mathematical Logic [1967,

p. 267] has a brief discussion of reducing one predicate to another and on

degrees of unsolvability. The only genuine introduction to computability I

58

found which introduces relative computability immediately is Martin Davis

Computability and Unsolvability [1958], which deﬁnes it on page 20 of Chap-

ter 1 using oracle Turing machines. In the former book Soare [1987] and new

book [CTA] Turing a-machines come in Chapter I and Turing o-machines

at the beginning of Chapter III after which the book is based on Turing

reducibility. I thought of moving o-machines to Chapter I and doing it all

at once, but my students persuaded me that people need time to absorb the

concepts. Nevertheless, I believe that one should introduce o-machines and

relative computability as soon as possible.

14 Conclusions

Conclusion 14.1. We should use the term “recursive” to mean “deﬁned

inductively” not “calculable” or “computable.” The subject is called “Com-

putability Theory” not “Recursive Function Theory” or “Recursion Theory.”

Church and Kleene [1936] introduced the term “recursive” to mean “com-

putable” primarily for public relations reasons as Kleene [1981] explained

(see '2.3). Over the next few decades Kleene reinforced and promulgated

this convention, but by the 1990’s it had become much more useful for

communication and more accurate scientiﬁcally and historically to remove

the meaning of “computable” from the term “recursive,” particularly since

Turing and G¨odel had both rejected this usage. This change has largely

been accomplished since the papers on computability and recursion in Soare

[1996] and Soare [1999]. See these papers and the discussion in '11. This

emphasis on computability (rather than recursion) and its relation to in-

computability has been developed in many recent books and papers such as

Cooper [2004].

Conclusion 14.2. It is most accurate and informative to refer to the central

thesis of the subject as the “Computability Thesis” not “Church’s Thesis,”

“Turing’s Thesis,” or the “Church-Turing Thesis.”

It is misleading to refer to it as “Church’s Thesis” as many people do

because Church never demonstrated the thesis (at least to the satisfaction of

G¨odel and modern scholars like Gandy [1988] and Sieg [1994]), but Turing

did demonstrate his thesis in a manner convincing to essentially everyone.

Church gave a formal model (the Herbrand-G¨odel general recursive func-

tions) which was not convincing even to its author, while Turing invented

a new model, the Turing a-machine which everyone, including Church and

Kleene, agreed was the most convincing of the thesis.

59

Neither of Turing nor G¨odel thought of this as a thesis. The term

“Church’s thesis” was started arbitrarily by Kleene alone in [1952]. We

use the term “the calculus” without the name of either founder, Newton or

Leibniz, attached. Why not replace the name in computability by a descrip-

tive and informative term like “Computability Thesis?” See the discussion

in '12.

Conclusion 14.3. The subject is primarily about incomputable objects not

computable ones, and has been since the 1930’s. The single most important

concept is that of relative computability to relate incomputable objects.

See '13 and '4–'7.

Conclusion 14.4. For pedagogical reasons with beginning students it is

reasonable to ﬁrst present Turing a-machines and ordinary computability.

However, any introductory computability book should then present as soon

as possible Turing oracle machines (o-machines) and relative computabil-

ity. Parallels should be drawn with oﬄine and online computing in the real

world.

See '13.4.

References

[1] [Ambos-Spies and Fejer, ta] K. Ambos-Spies, and P. Fejer, Degrees of

unsolvability Handbook of Logic, volume 9, to appear.

[2] [Boolos and Jeﬀrey, 1974] G. Boolos and R. Jeﬀrey, Computability and

Logic, Cambridge Univ. Press, Cambridge, Engl., 1974.

[3] [Church, 1935] A. Church, An unsolvable problem of elementary num-

ber theory, Preliminary Report (abstract), Bull. Amer. Math. Soc. 41

(1935), 332-333.

[4] [Church, 1936] A. Church, An unsolvable problem of elementary num-

ber theory, American J. of Math., 58 (1936), 345-363.

[5] [Church, 1936b] A. Church, A note on the Entscheidungsproblem, J.

Symbolic Logic, 1 (1936), 40–41. Correction 101–102.

[6] [Church, 1937] A. Church, Review of Turing 1936, J. Symbolic Logic

2(1) (1937), 42–43.

60

[7] [Church, 1937b] A. Church, Review of Post 1936, J. Symbolic Logic

2(1) (1937), 43.

[8] [Church, 1938] A. Church, The constructive second number class,

Bull. A.M.S. 44 (1938), 224–232.

[9] [Church and Kleene, 1936] A. Church and S. C. Kleene, Formal deﬁ-

nitions in the theory of ordinal numbers, Fund. Math. 28 (1936) 11–21.

[10] [Cooper, 2004] S.B. Cooper, Computablility Theory, Chapman &

Hall/CRC Mathematics, London, New York, 2004.

[11] [Cooper, 2004b] S.B. Cooper, The incomparable Alan Turing, Lec-

ture at Manchester University, 5 June, 2004, published electronically,

http://www.bcs.org/server.php?show=ConWebDoc.17130

[12] [Cooper-Lowe-Sorbi, 2007] S.B. Cooper, B. L¨owe, A. Sorbi, (eds.),

Computation and Logic in the Real World, Proceedings of the Third

Conference on Computability in Europe, CiE 2007, Siena, Italy, June

18–23, 2007, Lecture Notes in Computer Science, No. 4497, S.B.

Cooper, B. L¨owe, Andrea Sorbi (Eds.), (Springer-Verlag, Berlin, Hei-

delberg, 2007.

[13] [Cooper-Lowe-Sorbi, 2008] S.B. Cooper, B. L¨owe, A. Sorbi, (eds.),

New computational paradigms: changing conceptions of what is com-

putable, Springer-Verlag, 2008.

[14] [Cooper-Odifreddi, 2003] S.B. Cooper and P. Odifreddi, Incom-

putability in nature. In: S.B. Cooper and S.S. Goncharov (Eds.)

Computability and Models, Perspectives East and West, Kluwer Aca-

demic/Plenum, Dordrecht, (2003) 137–160.

B. L¨owe, A. Sorbi, (eds.), New computational paradigms: changing

conceptions of what is computable, Springer-Verlag, 2008.

[15] [Copeland-Posy-Shagrir, ta] Jack Copeland, Carl Posy, and Oron

Shagrir, Computability: G¨odel, Church, Turing, and Beyond, MIT

Press, to appear.

[16] [Csima-Soare, 2006] B. F. Csima and R.I. Soare, Computability Re-

sults Used in Diﬀerential Geometry, J. Symbolic Logic, vol. 71 (2006),

pp. 1394–1410.

61

[17] [Cutland, 1980] Nigel Cutland, Computability: An introduction to

recursive function theory, Cambridge Univ. Press, Cambridge, Engl.,

1980, reprinted 1983.

[18] [Davis, 1958] M. Davis, Computability and Unsolvability, Mc-Graw-

Hill, New York, 1958; reprinted in 1982 by Dover Publications.

[19] [Davis, 1965] M. Davis, (ed.), The Undecidable. Basic Papers on Un-

decidable Propositions, Unsolvable Problems, and Computable Func-

tions, Raven Press, Hewlett, New York, 1965.

[20] [Davis, 1982] M. Davis, Why G¨odel did not have Church’s Thesis,

Information and Control 54 (1982), 3–24.

[21] [Davis, 1988] M. Davis, Mathematical logic and the origin of modern

computers, In: Herken, 1988, 149–174.

[22] [Davis, 2000] M. Davis, The universal computer: The road from Leib-

niz to Turing, W.W. Norton & Co., New York, London, 2000. (The

same book was also published by Norton in 2000 under the title “En-

gine of Logic.”)

[23] [Davis, 2004] M. Davis, The myth of hypercomputation. In:

Teutscher, C. (Ed), Alan Turing: Life and Legacy of a Great Thinker,

Springer-Verlag, Berlin, Heidelberg, New York, (2004) 195–211.

[24] [Dawson, 1997] J. W. Dawson, Logical dilemmas: The life and work of

Kurt G¨odel, A.K. Peters Press, Cambridge, 1997.

[25] [Epstein and Carnielli, 1989] Epstein and Carnielli, Computability,

Computable Functions, Logic, and the Foundations of Mathematics,

1989, Second Printing Wadsworth Thomson Learning, 2000.

[26] [Friedberg, 1957] R. M. Friedberg, Two recursively enumerable sets

of incomparable degrees of unsolvability, Proc. Natl. Acad. Sci. USA

43 (1957), 236–238.

[27] [Friedberg-Rogers, 1959] R. M. Friedberg and H. Rogers, Jr. Re-

ducibility and completeness for sets of integers, Z. Math. Logik Grund-

lag. Math. 5 (1959), 117–125.

[28] [Gandy, 1980] R. Gandy, Church’s thesis and principles for mecha-

nisms, In: The Kleene Symposium, North-Holland, (1980), 123–148.

62

[29] [Gandy, 1988] R. Gandy, The conﬂuence of ideas in 1936, In: Herken,

55–111.

[30] [G¨odel, 1931] K. G¨odel,

¨

Uber formal unentscheidbare s¨atze der Prin-

cipia Mathematica und verwandter systeme. I, Monatsch. Math. Phys.

38 (1931) 173-178. (English trans. in Davis [1965, 4–38], and in van

Heijenoort, 1967, 592–616.)

[31] [G¨odel, 1934] K. G¨odel, On undecidable propositions of formal math-

ematical systems, Notes by S. C. Kleene and J. B. Rosser on lectures

at the Institute for Advanced Study, Princeton, New Jersey, 1934, 30

pp. (Reprinted in Davis [1965, p. 39–74].)

[32] [G¨odel, 193?] K. G¨odel, Undecidable diophantine propositions, In:

G¨odel [1995, 156–175].

[33] [G¨odel, 1946] K. G¨odel, Remarks before the Princeton bicentennial

conference of problems in mathematics, 1946. Reprinted in: Davis

[1965, p. 84–88].

[34] [G¨odel, 1951] K. G¨odel, Some basic theorems on the foundations of

mathematics and their implications, In: G¨odel [1995, 304–323]. (This

was the Gibbs Lecture delivered by G¨odel on December 26, 1951 to the

Amer. Math. Soc.)

[35] [G¨odel, 1964] K. G¨odel, Postscriptum to G¨odel [1931], written in 1946,

printed in Davis [1965, 71–73].

[36] [G¨odel, 1972] K. G¨odel, Some remarks on the undecidability results,

(written in 1972); In: G¨odel [1990, p. 305–306].

[37] [G¨odel, 1986] K. G¨odel, Collected works Volume I: Publications 1929–

1936, S. Feferman et. al., editors, Oxford Univ. Press, Oxford, 1986.

[38] [G¨odel, 1990] K. G¨odel, Collected works Volume II: Publications 1938–

1974, S. Feferman et. al., editors, Oxford Univ. Press, Oxford, 1990.

[39] [G¨odel, 1995] K. G¨odel, Collected works Volume III: Unpublished es-

says and lectures, S. Feferman et. al., editors, Oxford Univ. Press, Ox-

ford, 1995.

[40] [Goldin-Smolka-Wegner] D. Goldin, S. Smolka, P. Wegner, Interac-

tive Computation: The new Paradigm, Springer-Verlag, 2006.

63

[41] [Herken, 1988] R. Herken (ed.), The Universal Turing Machine: A

Half-Century Survey, Oxford Univ. Press, 1988.

[42] [Hilbert, 1899] D. Hilbert, Grundlagen der Geometrie, 7th ed.,

Tuebner-Verlag, Leipzig, Berlin, 1930.

[43] [Hilbert, 1904] D. Hilbert,

¨

Uber die Grundlagen der Logik

und der Arithmetik, In:Verhandlungen des Dritten Internationalen

Mathematiker-Kongresses in Heidelberg vom 8. bis 13. August 1904,

pp. 174–185, Teubner, Leipzig, 1905. Reprinted in van Heijenoort [1967,

129–138].

[44] [Hilbert, 1926] D. Hilbert,

¨

Uber das Unendliche, Mathematische An-

nalen 95 (1926), 161–190. (English trans. in van Heijenoort [1967, 367–

392].)

[45] [Hilbert, 1927] D. Hilbert, Die Grundlagen der Mathematik, Abhand-

lungen aus dem mathematischen Seminar der Hamburgischen Univer-

sit¨at 6 (1928), 65–85. Reprinted in van Heijenoort [1967, 464–479].

[46] [Hilbert and Ackermann, 1928] D. Hilbert and W. Ackermann,

Grundz¨ uge der theoretischen Logik, Springer, Berlin, 1928 (English

translation of 1938 edition, Chelsea, New York, 1950).

[47] [Hilbert and Bernays, 1934] D. Hilbert and P. Bernays, Grundlagen

der Mathematik I (1934), II (1939), Second ed., I (1968), II (1970),

Springer, Berlin.

[48] [Hodges, 1983] A. Hodges, Alan Turing: The Enigma, Burnett Books

and Hutchinson, London, and Simon and Schuster, New York, 1983.

[49] [Hodges, 2004] A. Hodges, Alan Turing: the logical and physical basis

of computing, Lecture at Manchester University, 5 June, 2004, pub-

lished electronically, http://www.bcs.org/ewics.

[50] [Kleene, 1936] S. C. Kleene, General recursive functions of natural

numbers, Math. Ann. 112 (1936), 727–742.

[51] [Kleene, 1936b] S. C. Kleene, λ-deﬁnability and recursiveness, Duke

Math. J. 2 (1936), 340–353.

[52] [Kleene, 1936c] S. C. Kleene, A note on recursive functions, Bull.

A.M.S. 42 (1936), 544–546.

64

[53] [Kleene, 1938] S. C. Kleene, On notation for ordinal numbers, J. Sym-

bolic Logic, 3 (1938), 150–155.

[54] [Kleene, 1943] S. C. Kleene, Recursive predicates and quantiﬁers,

Trans. A.M.S. 53 (1943), 41–73.

[55] [Kleene, 1944] S. C. Kleene, On the forms of the predicates in the

theory of constructive ordinals, Amer. J. Math. 66 (1944), 41–58.

[56] [Kleene, 1952] S. C. Kleene, Introduction to Metamathematics, Van

Nostrand, New York (1952). Ninth reprint 1988, Walters-Noordhoﬀ

Publishing Co., Groning¨en and North-Holland, Amsterdam.

[57] [Kleene, 1955] S. C. Kleene, Arithmetical predicates and function

quantiﬁers, Trans. A.M.S. 79 (1955), 312–340.

[58] [Kleene, 1955b] S. C. Kleene, On the forms of the predicates in the the-

ory of constructive ordinals (second paper), Amer J. Math. 77 (1955),

405–428.

[59] [Kleene, 1955c] S. C. Kleene, Hierarchies of number-theoretical pred-

icates, Bull. A.M.S. 61 (1955), 193–213.

[60] [Kleene, 1959] S. C. Kleene, Recursive functionals and quantiﬁers of

ﬁnite type I, Trans. A.M.S. 91 (1959), 1–52.

[61] [Kleene, 1962] S. C. Kleene, Turing-machine computable functionals

of ﬁnite types I, Logic, methodology, and philosophy of science: Pro-

ceedings of the 1960 international congress, Stanford University Press,

1962, 38–45.

[62] [Kleene, 1962b] S. C. Kleene, Turing-machine computable functionals

of ﬁnite types II, Proc. of the London Math. Soc. 12 (1962), no. 3,

245–258.

[63] [Kleene, 1963] S. C. Kleene, Recursive functionals and quantiﬁers of

ﬁnite type II, Trans. A.M.S. 108 (1963), 106–142.

[64] [Kleene, 1967] S. C. Kleene, Mathematical Logic, John Wiley and

Sons, Inc., New York, London, Sydney, 1967.

[65] [Kleene, 1981] S. C. Kleene, Origins of recursive function theory, An-

nals of the History of Computing, 3 (1981), 52–67.

65

[66] [Kleene, 1981b] S. C. Kleene, The theory of recursive functions, ap-

proaching its centennial, Bull. A.M.S. (n.s.) 5, (1981), 43–61.

[67] [Kleene, 1981c] S. C. Kleene, Algorithms in various contexts, Proc.

Sympos. Algorithms in Modern Mathematics and Computer Science

(dedicated to Al-Khowarizimi) (Urgench, Khorezm Region, Uzbek,

SSSR, 1979), Springer-Verlag, Berlin, Heidelberg and New York, 1981.

[68] [Kleene, 1987] S. C. Kleene, Reﬂections on Church’s Thesis, Notre

Dame Journal of Formal Logic, 28 (1987), 490–498.

[69] [Kleene, 1987b] S. C. Kleene, G¨odel’s impression on students of logic

in the 1930’s, In: P. Weingartner and L. Schmetterer (eds.), G¨odel

Remembered, Bibliopolis, Naples, 1987, 49–64.

[70] [Kleene, 1988] S. C. Kleene, Turing’s analysis of computability, and

major applications of it, In: Herken 1988, 17–54.

[71] [Kleene-Post, 1954] S. C. Kleene and E. L. Post, The upper semi-

lattice of degrees of recursive unsolvability, Ann. of Math. 59 (1954),

379–407.

[72] [Lerman, 1983] M. Lerman, Degrees of Unsolvability: Local and Global

Theory, Springer-Verlag, Heidelberg New York Tokyo, 1983.

[73] [Muchnik, 1956] A. A. Muchnik, On the unsolvability of the problem of

reducibility in the theory of algorithms, Doklady Akademii Nauk SSR

108 (1956), 194–197, (Russian).

[74] [Odifreddi, 1989] P. Odifreddi, Classical Recursion Theory, North-

Holland, Amsterdam, Volume I 1989, Volume II 1999.

[75] [Olszewski, 2007] A. Olszewski and J. Wolenski (Eds.), Church’s The-

sis After 70 years, Ontos Verlag, 2007. (551 pages, hardbound.) (ISBN-

13: 978-3938793091.)

[76] [Peter, 1934] R. P´eter,

¨

Uber den Zussammenhang der verschiedenen

Begriﬀe der rekursiven Funktion, Mathematische Annalen 110 (1934),

612–632.

[77] [Peter, 1951] R. P´eter, Rekursive Funktionen, Akad´emaiai Kiad´o

(Akademische Verlag), Budapest, 1951, 206 pp. Recursive Functions,

Third revised edition, Academic Press, New York, 1967, 300 pp.

66

[78] [Post, 1936] E. L. Post, Finite combinatory processes–formulation, J.

Symbolic Logic 1 (1936) 103–105. Reprinted in Davis [1965, 288–291].

[79] [Post, 1941] E. L. Post, Absolutely unsolvable problems and relatively

undecidable propositions: Account of an anticipation. (Submitted for

publication in 1941.) Printed in Davis [1965, 340–433].

[80] [Post, 1943] E. L. Post, Formal reductions of the general combinatorial

decision problem, Amer. J. Math. 65 (1943), 197–215.

[81] [Post, 1944] E. L. Post, Recursively enumerable sets of positive inte-

gers and their decision problems, Bull. Amer. Math. Soc. 50 (1944),

284–316. (Reprinted in Davis [1965, 304–337].)

[82] [Post, 1946] E. L. Post, Note on a conjecture of Skolem, J. Symbolic

Logic 11 (1946), 73–74.

[83] [Post, 1947] E. L. Post, Recursive unsolvability of a problem of Thue,

J. Symbolic Logic 12 (1947), 1–11. (Reprinted in Davis [1965, 292–303].)

[84] [Post, 1948] E. L. Post, Degrees of recursive unsolvability: preliminary

report (abstract), Bull. Amer. Math. Soc. 54 (1948), 641–642.

[85] [Putnam, 1956] H. Putnam, Trial and error predicates and the solu-

tion to a problem of Mostowski, J. Symbolic Logic 30, 49–57.

[86] [Rogers, 1967] H. Rogers, Jr., Theory of Recursive Functions and

Eﬀective Computability, McGraw-Hill, New York, 1967.

[87] [Sacks, 1990] G. E. Sacks, Higher Recursion Theory, Springer-Verlag,

Heidelberg New York, 1990.

[88] [Shoenﬁeld, 1967] J. R. Shoenﬁeld, Mathematical Logic, Addison-

Wesley, Reading, Mass. (1967), 344 pp.

[89] [Shoenﬁeld, 1971] J. R. Shoenﬁeld, Degrees of Unsolvability, North-

Holland, Amsterdam, London, New York, 1971.

[90] [Shoenﬁeld, 1991] J. R. Shoenﬁeld, Recursion Theory, Lecture Notes

in Logic, Springer-Verlag, Heidelberg New York, 1991.

[91] [Shoenﬁeld, 1995] J. R. Shoenﬁeld, The mathematical work of

S. C. Kleene, Bull. A.S.L 1 (1995), 8–43.

67

[92] [Sieg, 1994] W. Sieg, Mechanical procedures and mathematical ex-

perience, In: A. George (ed.), Mathematics and Mind, Oxford Univ.

Press, 1994.

[93] [Soare, 1987] R. I. Soare, Recursively Enumerable Sets and Degrees:

A Study of Computable Functions and Computably Generated Sets,

Springer-Verlag, Heidelberg, 1987.

[94] [Soare, 1996] R. I. Soare, Computability and recursion, Bulletin of

Symbolic Logic 2 (1996), 284–321.

[95] [Soare, 1999] R. I. Soare, The history and concept of computability,

In: Handbook of Computability Theory, ed. E. Griﬀor, North-Holland,

Amsterdam, 1999, 3–36.

[96] [Soare, 2000] R. I. Soare, Extensions, Automorphisms, and Deﬁn-

ability, in: P. Cholak, S. Lempp, M. Lerman, and R. Shore, (eds.)

Computability Theory and its Applications: Current Trends and

Open Problems, American Mathematical Society, Contemporary Math.

#257, American Mathematical Society, Providence, RI, 2000. pps. 279–

307.

[97] [Soare, 2004] R. I. Soare, Computability theory and diﬀerential ge-

ometry, Bull. Symb. Logic, Vol. 10 (2004), 457–486.

[98] [Soare, 2007] R. I. Soare, Computability and Incomputability, Com-

putation and Logic in the Real World, in: Proceedings of the Third Con-

ference on Computability in Europe, CiE 2007, Siena, Italy, June 18–23,

2007, Lecture Notes in Computer Science, No. 4497, S.B. Cooper, B.

L¨owe, Andrea Sorbi (Eds.), (Springer-Verlag, Berlin, Heidelberg, 2007.

[99] [Soare, CTA] R. I. Soare, Computability Theory and Applications,

Springer-Verlag, Heidelberg, to appear.

[100] [Soare, ta] R. I. Soare, Turing-Post Oracle Computability and Re-

aligning Computability Theory, in: Jack Copeland, Carl Posy, and

Oron Shagrir (eds.), Computability: G¨odel, Church, Turing, and Be-

yond, MIT Press, to appear.

[101] [Teuscher, 2004] C. Teuscher (ed.), Alan Turing: Life and legacy of

a great thinker, Springer-Verlag, 2004.

68

[102] [Turing, 1936] A. M. Turing, On computable numbers, with an ap-

plication to the Entscheidungsproblem, Proc. London Math. Soc. ser. 2

42 (Parts 3 and 4) (1936) 230–265; [Turing, 1937a] A correction,

ibid. 43 (1937), 544–546.

[103] [Turing, 1937b] A. M. Turing, Computability and λ-deﬁnability,

J. Symbolic Logic, 2 (1937), 153–163.

[104] [Turing, 1939] A. M. Turing, Systems of logic based on ordinals,

Proc. London Math. Soc. 45 Part 3 (1939), 161–228; reprinted in Davis

[1965, 154–222].

[105] [Turing, 1948] A. M. Turing, Intelligent machinery, In: Machine In-

telligence 5, 3–23. (Written in September, 1947 and submitted to the

National Physical Laboratory in 1948.)

[106] [Turing, 1949] A. M. Turing, Text of a lecture by Turing on June 24,

1949, In: F. L. Morris and C. B. Jones, “An early program proof by

Alan Turing,” Annals of the History of Computing 6 (1984), 139-143.

[107] [Turing, 1950] A. M. Turing, Computing machinery and intelligence,

Mind 59 (1950) 433–460.

[108] [Turing, 1950b] A. M. Turing, The word problem in semi-groups with

cancellation, Ann. of Math. 52 (1950), 491–505.

[109] [Turing, 1954] A. M. Turing, Solvable and unsolvable problems, Sci-

ence News 31 (1954), 7–23.

[110] [Turing, 1986] A. M. Turing, Lecture to the London Mathematical

Society on 20 February 1947, In: B. E. Carpenter and R. W. Doran,

eds., A. M. Turing’s ACE Report of 1946 and Other Papers, Cambridge

Univ. Press, 1986, 106–124.

[111] [Wang, 1974] H. Wang, From Mathematics to Philosophy, Routledge

& Kegan Paul, London, 1974.

[112] [Wang, 1981] H. Wang, Some facts about Kurt G¨odel, J. Symbolic

Logic 46 (1981) 653–659.

[113] [Wang, 1987] H. Wang, Reﬂections on Kurt G¨odel, MIT Press, Cam-

bridge, MA.

[114] [Wang, 1993] H. Wang, On physicalism and algorithmism: can ma-

chines think?, Philosophia Mathematica, 3rd series 1 (1993), 97–138.

69

Department of Mathematics

University of Chicago

Chicago, Illinois 60637-1546

soare@uchicago.edu

URL: http://www.people.cs.uchicago.edu/∼soare/

70

3.3 3.4 3.5

3.2.3 The Flaw in Church’s Thesis . . . . . . . . 3.2.4 G¨del on Church’s Thesis . . . . . . . . . . o 3.2.5 G¨del’s Letter to Kreisel [1968] . . . . . . . o 3.2.6 Gibbs Lecture [1951] . . . . . . . . . . . . . 3.2.7 Godel’s Postscriptum 3 June, 1964 to G¨del o Hao Wang Reports on G¨del . . . . . . . . . . . . o Kleene’s Remarks About Turing . . . . . . . . . . Church’s Remarks About Turing . . . . . . . . . .

. . . . . . . . . . . . . . . . [1934] . . . . . . . . . . . .

. . . . . . . .

. . . . . . . .

16 17 17 17 18 19 19 20 20 21 21 23 23 23 24 25 25 26 26 28 28

4 Oracle Machines and Relative Computability 4.1 Turing’s Oracle Machines . . . . . . . . . . . . . . . . . 4.2 Modern Deﬁnitions of Oracle Machines . . . . . . . . . . 4.2.1 The Graph of a Partial Computable Function . . 4.2.2 The Graph of an Oracle Computable Functional 4.3 The Oracle Graph Theorem . . . . . . . . . . . . . . . . 4.4 Equivalent Deﬁnitions of Relative Computability . . . . 4.4.1 Notation for Functions and Functionals . . . . . 5 Emil Post Expands Turing’s Ideas 5.1 Post’s Work in the 1930’s . . . . . . . . . . . . . 5.2 Post Steps Into Turing’s Place During 1940–1954 5.3 Post’s Problem on Incomplete C.E. Sets . . . . . 5.4 Post Began With Strong Reducibilities . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

6 Post Highlights Turing Computability 29 6.1 Post Articulates Turing Reducibility . . . . . . . . . . . . . . 29 6.2 The Post-Turing Thesis . . . . . . . . . . . . . . . . . . . . . 30 7 Continuous and Total Functionals 7.1 Representations of Open and Closed Sets . . . . 7.2 Notation for Trees . . . . . . . . . . . . . . . . . 7.3 Dense Open Subsets of Cantor Space . . . . . . . 7.4 Eﬀectively Open and Closed Sets . . . . . . . . . 7.5 Continuous Functions on Cantor Space . . . . . . 7.6 Eﬀectively Continuous Functionals . . . . . . . . 7.7 Continuous Functions are Relatively Computable 31 31 31 33 33 34 35 36

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

8 Bounded Reducibilities 36 8.1 A Matrix Mx for Bounded Reducibilities . . . . . . . . . . . . 36 8.2 Bounded Turing Reducibility . . . . . . . . . . . . . . . . . . 37

2

8.3 8.4

Truth-Table Reductions . . . . . . . . . . . . . . . . . . . . . Diﬀerence of c.e. sets, n-c.e., and ω-c.e. sets . . . . . . . . . .

37 39 40 42 42 43 44 44 44 45 45 46 46 47 48 48 50 50 50 51 51 52 54 55 57 57 57 57 58 59

9 Online Computing 9.1 Turing Machines and Online Processes . 9.2 Trial and Error Computing . . . . . . . 9.3 The Limit Lemma . . . . . . . . . . . . 9.4 Two Models for Computing With Error 9.4.1 The Limit Computable Model . . 9.4.2 The Online Model . . . . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

10 Three Displacements in Computability Theory 11 “Computable” versus “Recursive” 11.1 Church Defends Church’s Thesis with “Recursive” . . . 11.2 Church and Kleene Deﬁne “Recursive” as “Computable” 11.3 G¨del Rejects “Recursive Function Theory” . . . . . . . o 11.4 The Ambiguity in the Term “Recursive” . . . . . . . . . 11.5 Changing “Recursive” Back to “Inductive” . . . . . . . 12 Renaming it the “Computability Thesis?” 12.1 Kleene Called it “Thesis I” in [1943] . . . . . . . . . 12.2 Kleene Named it “Church’s thesis” in [1952] . . . . . 12.3 Kleene Dropped “Thesis I” for “Church’s thesis” . . 12.4 Evidence for the Computability Thesis . . . . . . . . 12.5 Who First Demonstrated the Computability Thesis? 12.6 The Computability Thesis and the Calculus . . . . . 12.7 Founders of Computability and the Calculus . . . . . 13 Turing a-machines versus o-machines? 13.1 Turing, Post, and Kleene on Relative Computability 13.2 Relative Computability Uniﬁes Incomputability . . . 13.3 The Key Concept of the Subject . . . . . . . . . . . 13.4 When to Introduce Relative Computability . . . . . 14 Conclusions

Abstract We begin with the history of the discovery of computability in the 1930’s, the roles of G¨del, Church, and Turing, and the formalisms of o recursive functions and Turing automatic machines (a-machines). To

. . . . .

. . . . .

. . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . . . . .

. . . .

. . . .

. . . .

. . . .

. . . .

3

4 . At the end in §10 – §13 we consider three displacements in computability theory. 1 Introduction In this paper we consider the development of Turing oracle machines and relative computability and its relation to continuity in analysis and to online computing in the real world. very great. and online computing are the most important concepts in the subject.” Neither dictionary lists an entry for “noncomputable” although it has often been used in the subject to mean “not computable” for a speciﬁc function or set analogously as “nonmeasurable” is used in analysis.” The term “incomputable” appeared in English as early as 1606 with the meaning. incalculable. We use the term “noncomputable” or “incomputable” for individual instances. more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented ﬁrst only for pedagogical clarity to beginning students. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. and ﬁnally KleenePost [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on Cantor space and online computations. §11]. but we often use the term “incomputability” for the general concept because it is linguistically and mathematically parallel to “incomplete. Several brief conclusions are drawn in §14. relative computability. §4] of an oracle machine (o-machine) and Post’s development of it in [1944.whom did G¨del credit the deﬁnition of a computable function? We o present Turing’s notion [1939.1 Terminology: Incompleteness and Incomputability The two principal accomplishments in computability and logic in the 1930’s were the discovery of incompleteness by G¨del [1931] and of incomputabilo ity independently by Church [1936] and Turing in [1936]. Therefore. and the historical reasons they occurred. that which “cannot be computed or reckoned.” according to the Oxford English Dictionary. Websters dictionary deﬁnes it as “greater than can be computed or enumerated. 1. We also challenge a number of traditional views of these subjects as often presented in the literature since the 1930’s. [1948]. we argue that Turing o-machines.

For example. Turing a-machines. a laptop computer might consult the World Wide Web via an ethernet or wireless connection while it is computing. In the 1930’s for the ﬁrst time the goal was the refutation of Hilbert’ two programs. Alonzo Church and Alan Turing.D. with which one could diagonalize and produce undecidable problems in mathematics. The speciﬁc models of computable functions produced by 1936.1. Turing spent 1936–1938 at Princeton writing a Ph. a ﬁnite consistency proof for Peano arithmetic. would all have deep applications to the design and programming of computing machines. 1. the researchers spent the remainder of the 1930’s investigating more of the new world of incomputability they had created by diagonal arguments. λ-deﬁnable functions. In §1 and §2 we consider this historical development from 1931 to 1939 and we introduce quotes from G¨del to show convincingly that he believed “the correct deﬁnition of meo chanical computability was established beyond any doubt by Turing” and only by Turing.2 The Goal of Incomputability not Computability For several thousand years the study of algorithms had led to new theoretical algorithms and sometimes new devices for computability and calculation. The Turing a-machine is a good model for oﬄine computing such as a calculator or batch processor where the process is initially given a procedure and an input and continues with no further outside information. §4] included 5 . Meanwhile. two main discoverers of computability. thesis under Church on ordinal logics. and recursive functions. However. but not until after 1940.3 Computing Relative to an Oracle or Database In 1936 Turing’s a-machines and Church’s use of G¨del’s recursive functions o solved an immediate problem by producing a deﬁnition of a computable function. many modern computer processes are online processes in that they consult an external data base of other resource during the computation process. just as Georg Cantor had spent the last quarter of the nineteenth century exploring the world of uncountable sets which he had created by the diagonal method. A tiny and obscure part of his paper [1939. wanted to give formal deﬁnitions of a computable function so that they could diagonalize over all computable functions and produce an incomputable (unsolvable) problem. These processes are sometimes called online or interactive or database processes depending on the way they are set up. For the latter. and the Entscheidungsproblem (decision problem).

for any continuous functional there is a Turing functional relative to some real parameter which deﬁnes it. These are summarized in the PostTuring Thesis of §6. particularly in view of the importance of relative computability (Turing o-machines) in comparison with plain computability (Turing a-machines) in both theoretical and practical areas. thereby linking computability with analysis. This makes Turing functionals the analogue in computability of the continuous functions in analysis as we explain.a description of an oracle machine (o-machine) roughly a Turing a-machine which could interrogate an “oracle” (external database) during the computation. [1944]. Emil Post [1944.2. but in Post [1943]. The theory of relative computability developed by Turing and Post and the o-machines provide a precise mathematical framework for database or online computing just Turing a-machines provide one for oﬄine computing processes such as batch processing. These concepts were not well understood when Post began. 1.” In §4–§6 we study Turing’s oracle machines (o-machines) and Post’s development of them into relative computability. In contrast. Conversely. there appears to be more emphasis in calculus books on continuous functionals than there is in introductory computability books on computably continuous functionals and relative computability. §11] considerably expanded and developed relative computability and Turing functionals.2 over the last seventy years and so little to the Post-Turing Thesis 6. The one page description was very sketchy and Turing never developed it further. It is surprising that so much attention has been paid to the Church-Turing Thesis 3. Turing a-machines viewed as functionals on Cantor space produce only a constant functional. Oracle computing processes are those most often used in theoretical research and also in real world computing where a laptop computer may communicate with a database like the World Wide Web.1 on relative reducibility. Surprisingly.4 Continuous Functions and Calculus In §7 we show that any Turing functional on Cantor space 2ω is an eﬀectively continuous partial map. This remarkable role by Post has been underemphasized in the literature but is discussed here in §5 and §6. [1948] and Kleene-Post [1954] they emerged into their modern state. 6 . Often the local computer is called the “client” and the remote device the “server.

2 Origins of Computability and Incomputability Mathematicians have studied algorithms and computation since ancient times. Hilbert [1899] gave an axiomatization of geometry and showed [1900] that the question of the consistency of geometry reduced to that for the real-number system. 108] wrote.) (We will know. “The Entscheidungsproblem for various formal systems had been posed by Schr¨der [1895]. 2. it should be possible.D. Hilbert’s second major program concerned the Entscheidungsproblem (decision problem). and Hilbert [1918]. L¨wenheim [1915].” Von Neumann (1927) doubted that such a procedure existed but had no idea how to prove it. to settle all mathematical questions in a purely mechanical manner. the importance of mathematics in science. Davis [1965. a quiet. u Wir werden wissen.1 G¨del’s Incompleteness Theorem o Hilbert retired in 1930 and was asked to give a special address in the fall of 1930 in K¨nigsberg. announced a result o 7 . Hilbert [1904] proposed proving the consistency of arithmetic by what emerged [1928] as his ﬁnitist program. p. Hilbert spoke on natural science o and logic. It was to give a decision procedure (Entscheidungsverfahren) “that allows one to decide the validity of the sentence. the Entscheidungsproblem. to arithmetic by results of Dedekind (at least in a second order system). and that in turn. only a year a beyond his Ph. He asserted that there are no unsolvable problems and stressed. 46] wrote. This tended to reduce proofs to manipulation of ﬁnite strings of symbols devoid of intuitive meaning which stimulated the development of mechanical processes to accomplish this. at least in principle. obscure young man. Kurt G¨del. David Hilbert was deeply interested in the foundations of mathematics. He proposed using the ﬁniteness of mathematical proofs in order to establish that contradictions could not be derived.) At a mathematical conference preceding Hilbert’s address. Wir m¨ssen wissen. (We must know. and the importance of logic in mathematics.” The decision probo o lem for ﬁrst order logic emerged in the early 1920’s in lectures by Hilbert and was stated in Hilbert and Ackermann [1928]. p.. “This was because it seemed clear to Hilbert that with the solution of this problem. but the modern study of computability and incomputability began around 1900.” Hilbert characterized this as the fundamental problem of mathematical logic. Kleene [1987b. the city of his birth.

2 Alonzo Church By 1931 computability was a young man’s game. As the importance of G¨del’s Incomo pleteness Theorem began to sink in. 1912). 2. and Stephen C. G¨del’s Incompleteness Theorem [1931] not only refuted o Hilbert’s program on proving consistency. 8 .which would forever change the foundations of mathematics. He formalized the liar paradox. 1897) was over thirty. but it also had a profound effect on refuting Hilbert’s second theme of the Entscheidungsproblem. Hilbert had retired and no longer had much inﬂuence on the ﬁeld. and researchers began concentrating on the Entscheidungsproblem. He was at the conference representing o Hilbert’s proof theory program. This made it easier to challenge Hilbert on the second topic of the decision problem. and in calling algorithms by their code numbers (G¨del numbers). was not even twenty. Crucial elements in computability theory. Only Emil Post (b. perhaps the most inﬂuential of all on computability theory. the Kleene µ-recursive functions. Turing (b. such as the Turing universal machine. 1909) were o all under thirty. diagonal arguments had been known since Cantor’s work. These ideas spring from G¨del’s [1931] incomo o pleteness proof. that o no such formal system T could prove its own consistency. the major ﬁgures were all young. one could prove an even better one. G¨del o had successfully challenged the Hilbert’s ﬁrst proposal. “This statement is false. Kleene (b. John von Neumann in the audience immediately understood the importance of G¨del’s Incompleteness Theorem.” to prove roughly that for any eﬀectively axiomatized. but G¨del showed how to arithmetize the o syntactic elements of a formal system and diagonalize within that system. Of course. consistent extension T of number theory (Peano arithmetic) there is a sentence σ which asserts its own unprovability in T . Kurt G¨del (b. Alonzo Church (born 1903). These young men were about to leave Hilbert’s ideas behind and open the path of computability for the next two thirds of the twentieth century. A few weeks later he brought his proof to G¨del who thanked him and informed him o politely that he had already submitted the Second Incompleteness Theorem for publication. all depend upon giving code numbers to computations and elements within a computation. and recognized that Hilbert’s program was over. In the next few weeks von Neuman realized that by arithmetizing the proof of G¨del’s ﬁrst theorem. which would solve the theoretical problems and would show the way toward practical computing devices. Both refutations used diagonal arguments. 1906). or the self reference in the Kleene’s Recursion Theorem. and he was not yet thirty-ﬁve.

” Soon the preﬁx “primitive” was added to the latter and the preﬁx “general” was generally dropped from the former. in 1934 he had shown that all the usual number theoretic functions were λ-deﬁnable. Although Kleene was convinced by Church’s ﬁrst thesis. p. the term in the 1930’s for a function which is computable in the informal sense.D. (See Davis [1965. In 1931 Church’s ﬁrst student. He returned o to Princeton as an Assistant Professor of Mathematics in 1929. p.After completing his Ph. the diagonal was one of the rows. When Kleene ﬁrst heard the thesis.) Deﬁnition 2.D. A function if eﬀectively calculable if and only if it is λ-deﬁnable. G¨del spent the ﬁrst part of 1934 at Princeton. In 1931 Church knew only that the successor function was λ-deﬁnable. Church had begun to develop a formal system now called the λ-calculus. Kleene. Instead of a contradiction.3 Herbrand-G¨del Recursive Functions o From 1933 to 1939 G¨del spent time both in Vienna pursuing his academic o career and at Fine Hall in Princeton which housed both the Princeton University faculty in mathematics and the Institute for Advanced Study. Church’s Thesis (First Version) [1934]. 1934 the ﬁrst o version of his thesis on functions which are eﬀectively calculable. 8–9].” 2. At Princeton in the spring of 1934 G¨del lectured on the Herbrand-G¨del recursive functions which came o o to be known as the general recursive functions to distinguish them from the primitive recursive functions which at that time were called “recursive functions. Kleene had proved a beautiful new theorem. the Kleene Recursion Theorem whose proof is a diagonal argument which fails (see Soare [1987. G¨del’s deﬁnition o gave a remarkably succinct system whose simple rules reﬂected the way a mathematician would informally calculate a function using recursion. Kleene began proving that certain well-known functions were λ-deﬁnable. 9 . On the basis of this evidence and his own intuition. o The primitive recursive functions which he had used in his 1931 paper did not constitute all computable functions. G¨del rejected Church’s o o ﬁrst thesis as “thoroughly unsatisfactory.1. G¨del was not. of which he was a member. 36]). Church proposed to G¨del around March. Alonzo Church spent one year at Harvard and one year at G¨ttingen and Amsterdam. he tried to refute it by a diagonal argument but since the λ-deﬁnable functions were only partial functions. at Princeton in 1927. He expanded on a concept of Herbrand and brought closer to the modern form. By the time Kleene received his Ph. arrived at Princeton. Stephen C.

It is maintained o that the notion of an eﬀectively calculable function of positive integers should be identiﬁed with that of a recursive function. “In this paper a deﬁnition of recursive function of positive integers which is essentially G¨del’s is adopted.” o Kleene [1981] wrote. A function on the positive integers is eﬀectively calculable if and only if it is recursive. with Herbrand-G¨del recursive functions o in place of λ-deﬁnable ones. Church and Kleene had shown the formal equivalence of the Herbrand-G¨del recursive functions and the λ-deﬁnable funco tions. Church’s Thesis [1936]. o Rosser and Kleene took notes which appeared as G¨del [1934]. chose. As further evidence.. After seeing o G¨del’s lectures. such as functional programming. perhaps unduly inﬂuenced by rather chilly receptions from audiences around 1933–35 to disquisitions on λ-deﬁnability. functions deﬁned by the ﬁve schemata for primitive recursive functions. 2. his famous proposition described in his paper [1936]. “I myself.2. .Church and Kleene attended G¨del’s lectures on recursive functions.” It has been known since Kleene [1952] as Church’s Thesis in the following form. λ-deﬁnability is a precise calculating system and has close connections to modern computing. Church and Kleene changed their formalism (especially for o Church’s Thesis) from “λ-deﬁnable” to “Herbrand-G¨del general recursive. to put my work in that format. The µ-recursive functions had the advantage of a short standard mathematical deﬁnition. This time without consulting G¨del. o 10 . . . plus the least number operator µ.4 Stalemate at Princeton Over Church’s Thesis Church reformulated his thesis. Deﬁnition 2. . but the disadvantage that any function not primitive recursive could be calculated only by a tedious arithmetization as in G¨del’s Incompleteness Theorem. 1935. ” Nevertheless.. the µ-recursive functions. after general recursiveness had appeared. Church o presented to the American Mathematical Society on April 19. Kleene introduced a new equivalent deﬁnition.

Kleene. “[Primitive] recursive functions have the important property that. 3 3. but it serves as a heuristic principle. since the notion of ﬁnite computation is not deﬁned. Here o he even suggests that such a precise mathematical characterization of the informal notion cannot be proved which makes his acceptance of Turing’s later work even more impressive.1 Turing Breaks the Stalemate Turing Machines and Turing’s Thesis At the start of 1936 those gathered at Princeton: G¨del. G¨del had become the most prominent ﬁgure in matho ematical logic.. G¨del’s footnote 3.” This suggests that G¨del was waiting not only for a formal deﬁnition o (such as recursive functions or Turing machines which came later) but evidence that these captured the informal notion of eﬀectively calculable (which Turing later gave. if.2.g. Church had solved the Entscheidungsproblem only if his characterization of eﬀectively calculable functions was accurate. It was his approval that Church wanted most.” Footnote 3. besides recursion according to scheme (V) [primitive recursion]. G¨del had considered the question of o characterizing the calculable functions in [1934] when he wrote. Second. o Rosser. This cannot be proved.5 G¨del’s Thoughts on Church’s Thesis o In spite of this evidence. with respect to two variables simultaneously) are admitted. his ﬁnal sentence suggests that he may have believed such a characterization “cannot be proved. but which G¨del did not ﬁnd in Church’s work). Church. gives crucial insight into his o thinking about the computability thesis and his later pronouncements about the achievements of Turing versus others. G¨del says later that he was not o sure that his system of Herbrand-G¨del recursive functions comprised all o possible recursions.” but is a “heuristic principle. constituted the most 11 . “The converse seems to be true.” The second paragraph. and Post nearby at City College in New York. for each given set of values for the arguments. recursions of other forms (e. G¨del still did not accept Church’s Thesis by the o beginning of 1936. the value of the function can be computed by a ﬁnite procedure3 .

1 12 . i. This is important because of the appearance in 1936 of related papers by Church. and Post.” or sometimes “[1936-37]. [1987].. 1936. not knowing it had been previously proved. [1987b]. Kleene and Post [1954. (Max) Newman gave lectures on Hilbert’s Entscheidungsproblem in 1935. as deﬁned in Turing [1936]. or perhaps because of the two page minor correction [1937a]. Kleene [1943. Others. 73]. Kleene. such as Kleene [1952]. the ﬁrst section of pages 230–240 in Volume 42. The work of Hilbert and G¨del had become well-known around the world. 456. and erase one square at a time before moving to an immediately adjacent square. and they published Turing’s paper in volume 42 on November 30. Vol. and Turing’s priority is important here. p. 1936–Read 12 November. G¨del Collected Works. 1936. Cambridge. Part 3.distinguished and powerful group in the world investigating the notion of a computable function and Hilbert’s Entscheidungsproblem. Gandy [1980]. write. 1936 and December 23. I.” It appeared in two sections. Newman persuaded them that Turing’s work was suﬃciently diﬀerent. Davis [1965. p.” perhaps because the volume 42 is 1936-37 covering 1936 and part of 1937. A function is intuitively computable (eﬀectively calculable) if and only if it is computable by a Turing machine. and the second section of pages 241–265 in Volume 42. Alan Turing attended. correctly refer to it as “[1936]. [1981]. far removed from Princeton.1 Many papers. 1936.” The journal states that Turing’s manuscript was “Received 28 May. o At Cambridge University topologist M.e. 1936. Post [1943. Well. [1981b]. and others. He designed his automatic machine (a-machine) as a kind of idealized typewriter with an inﬁnite carriage over which the reading head passes with the ability to read. Turing’s Thesis [1936]. 20]. The Proceedings of the London Mathematical Society was reluctant to publish Turing’s paper because Church’s had already been submitted to another journal on similar material. but they could not agree on whether recursive functions constituted all eﬀectively calculable functions. an automatic machine (a-machine). and others. 72]. There has been considerable misunderstanding in the literature about exactly when Turing’s seminal paper was published. and as a result Turing had been elected a Fellow of King’s College.A. issued on November 30. this was not just any youth. Cutland [1980].1. Turing’s mother had had a typewriter which fascinated him as a boy. Turing showed his solution to the astonished Max Newman in April. Part 4. At that moment stepped forward a twenty-two year old youth.H. just like a typewriter. mistakenly refer to this paper o as “Turing [1937]. Alan Turing had already proved the Central Limit Theorem in probability theory. p. 407]. p. p. Deﬁnition 3.

Equally important with the Turing machine was Turing’s analysis of the intuitive conception of a “function produced by a mechanical procedure. which we have listed by year of publication: Volume I. In the o o following article G¨del considers all these as equivalent formal deﬁnitions. which Robin Gandy considered as precise as most mathematical proofs. He had not accepted the argument of conﬂuence as suﬃcient to justify Church’s Thesis. 1936. G¨del [1986]. 3. G¨del o o o [1995]. Determining the correct date of publication of Turing’s work is important to place it chronologically in comparison with Church [1936]. o The question was whether they captured the informal concept of a function speciﬁed by a ﬁnite procedure. Also Turing [1936. G¨del was also well aware of Turing’s proof [1937b] of o the equivalence of λ-deﬁnable functions with Turing computable ones. However. and Kleene [1936]. Let us examine there what G¨del has to say. and hence the conﬂuence of all the known deﬁnitions. and Kleene had proved the equivalence with µ-recursive functions based on G¨del’s own arithmeo tization of 1931. even though it o was formulated with his own general recursive functions. G¨del was interested in the intensional analysis of ﬁnite proo cedure as given by Turing [1936].2 G¨del’s Opinion of Turing’s Work o G¨del never accepted Church’s Thesis in the form above. 243] introduced the universal Turing machine which has great theoretical and practical importance. issued December 23. The best source for articles of G¨del is the o three volume Collected Works.” In a masterful demonstration.Turing’s a-machine has compelling simplicity and logic which makes it even today the most convincing model of computability. G¨del clearly expresses o his opinion in his three volume collected works. 13 . Post [1936]. and Volume III. No part of Turing’s paper appeared in 1937. but G¨del and o most others accepted Turing’s Thesis. Turing analyzed the informal nature of functions computable by a ﬁnite procedure and demonstrated that they coincide with those computable by an a-machine. G¨del [1990]. o o and G¨del [1995]. Church and Kleene [1936b] had shown the formal equivalence of λ-deﬁnable functions. G¨del [1990]. G¨del [1986]. but the two page minor correction [1937a] did. Volume II. p. general recursive functions. G¨del knew of the extensional evo idence.

o Davis wrote. but having introduced Turing.2. “This article is taken from handwritten notes in English. o o “When I ﬁrst published my paper about undecidable propositions the result could not be pronounced in this generality.” To formally capture this crucial informal concept. 168.” The word “this” evidently refers to the recursive functions. and Kleene. 166] G¨del wrote.3. The essential point is to deﬁne what a procedure is. He intended his talk to be as elementary as possible for a general audience. What did he mean? G¨del knew that by work of Turing. It was Turing’s proof [1936] and the formal equivalences which had elevated Herbrand-G¨del recursive functions to a correct characo teristic of eﬀectively calculable functions. . p. G¨del knew o that Turing had never proved anything about recursive functions.) G¨del continued on p. 156]. G¨del now went forward o with Turing’s work. G¨del had begun with the recursive function as more easily explained to o a general audience. Church. 167. because for the notions of mechanical procedure and of formal system no mathematically satisfactory deﬁnition had been given at that time. not that the Herbrand-G¨del reo cursive functions had elevated Turing computable functions.1 G¨del [193?] Notes in Nachlass [1935] o This article has an introductory note by Martin Davis in G¨del [1995. 14 . found in the Nachlass in a spiral notebook. Indeed G¨del o had seen Church’s Thesis 2. o “That this really is the correct deﬁnition of mechanical computability was established beyond any doubt by Turing.” In the Nachlass printed in G¨del [1995. p. o the formal classes of Turing computable functions. and λ-deﬁnable functions all coincided. began with a deﬁnition of the primitive recursive functions (which he quickly proved inadequate by a diagonal argument) and then his own Herbrand-G¨del recursive functions on p.2 expressed in terms of Herbrand-G¨del recuro sive functions. who was giving o an introductory lecture. and had rejected it in 1935 and 1936 because he was not sure his own deﬁnition had captured the informal concept of procedure. . which he knew would be more familiar with recursion. evidently for a lecture. recursive functions. G¨del. G¨del was asserting that it was Turing o who had demonstrated that these formal classes captured the informal notion of a procedure. (G¨del o o gave the Herbrand-G¨del recursive function deﬁnition rather than Turing o machines because he knew they were equivalent. .

. Once we have a suﬃciently strong system (such as Peano arithmetic) we can prove anything about computable functions which could be proved in a more powerful system. on a slip of paper and put the slip into the machine and turn the crank then after ﬁnite number of turns the machine will stop and the value of the function for the argument n1 . Si+1 . one has been able to deﬁne them only relative to a given language. p. and for each individual language it is clear that the one thus obtained is not the one looked for. If you write down any number n1 . a p.“But Turing has shown more. It seems to me that this importance is largely due to the fact that with this concept one has for the ﬁrst time succeeded in giving an absolute deﬁnition of an interesting epistemogical notion. but also makes it possible to shorten by an extraordinary amount proofs already available.e. G¨del discussed what it means for a function to be computable o in a formal system S and remarked that given a sequence of formal systems Si . 2 15 . . . general o recursiveness. nr will be printed on the paper.” 3. Turing computability. and others. that it is not necessary to distinguish orders (diﬀerent formal systems). . Once again. .2 In all other cases treated previously. 396–398]. He has shown that the computable functions deﬁned in this way are exactly those for which you can construct a machine with ﬁnite number of parts which will do the following thing.2 Princeton Bicentennial [1946] ¨ To fully understand this article one should be familiar with G¨del’s Uber die o L¨nge von Beweisen” (“On the length of proofs) [1936a] in Volume I [1986. . as a single formal system. 150]. Now for G¨del’s Princeton Bicentennial address [1946] refer to the Colo lected Works Volume II. it is possible that passing from one formal system Si to one of higher order Si+1 not only allows us to prove certain propositions which were not provable before. one not depending on the formalism chosen. For the concept . . “Tarski has stressed in his lecture (and I think justly) the great importance of the concept of general recursiveness (or Turing’s computability). . . G¨del identiﬁes those formal systems known to be equivalent. nr . . “A function of integers is computable in any formal system containing arithmetic if and only if it is computable in arithmetic” . G¨del muses on the remarko o able fact of the absoluteness of computability. . . i. . such as demonstrability or deﬁnability. G¨del [1990.2..

” who wrote that without this assumption it is diﬃcult to see how the notion of a system of logic can be given any exact meaning at all. 80. something he did not justify. but G¨del did not o accept it then and gave no evidence later of believing that Church had done this. . By a kind of miracle it is not necessary to distinguish orders. this core does not provide a convincing analysis: steps taken in a calculus must be of a restricted character and they are assumed. Sieg [p. p. Gandy [1988. However. G¨del himself never claimed to have made this link. 57]). ” Who is the “one” who has linked the informal notion of procedure or eﬀectively calculable function to one of the formal deﬁnitions. although it is merely a special kind of demonstrability or decidability. however.5. 87] in their excellent analyses brought out this weakness in Church’s argument. pp.3 The Flaw in Church’s Thesis G¨del himself was the ﬁrst to provide one of the formalisms later recognized o as a deﬁnition of computability. the general recursive functions. . If the basic steps are stepwise recursive. . Modern scholars found weaknesses in Church’s attempted proof [1936] that the recursive functions constituted all eﬀectively calculable functions. the situation is diﬀerent.2. 79] and especially Sieg [1994. It is exactly this stumbling block which Turing overcame by a totally new approach.” G¨del stated. for example by Church. 1935 (see Kleene [1987b]. o “. 78] wrote. “. then it follows easily by the Kleene Normal Form Theorem which Kleene had proved and communicated to G¨del before November. “It is precisely here that we encounter the major stumbling block for Church’s analysis. p. . one has for the ﬁrst time succeeded in giving an absolute deﬁnition of an interesting epistemogical notion . Church claimed it in o his announcement of Church’s Thesis in 1935 and 1936.” Sieg [p. 80] wrote. . without argument to be recursive. 3. 16 . that the entire o process is recursive. and that stumbling block was quite clearly seen by Church. This becomes irrefutably clear in §3.of computability.2. The fatal weakness in Church’s argument was the core assumption that the atomic steps were stepwise recursive. and the diagonal procedure does not lead outside the deﬁned notion. .

Collected Works Volume III. Princeton Bicentennial. o “ But I was completely convinced only by Turing’s paper. o “Research in the foundations of mathematics during the past few decades has produced some results of interest. On the contrary. Church 1936. 1995. It is probable as Wang suggests ([1987. verifying the Computability Thesis].3. The results themselves.” – G¨del. “On 26 December 1951. “ o G¨del [1951] in his Gibbs lecture wrote. . not only in themselves. which. are fairly widely known. p. I believe. [G¨del. pages 117–18]).2. p. but nevertheless I think it will be useful to present them in outline once again. I. Vol. [1946. pp 150–153. 3.6 Gibbs Lecture [1951] G¨del. are much less suitable for our purpose. . . especially in view of the fact that due to the work 17 . . p. .. [i. 1968 [Sieg. G¨del said. and G¨del o o Collected Works. G¨del delivered the twentyo ﬁfth Josiah Willard Gibbs Lecture.2. but also with regard to their implications for the traditional philosophical problems about the nature of mathematics.2. pp. o “As for previous equivalent deﬁnitions of computability. but he never o gave any hint that he thought Church had been the ﬁrst to show that the recursive functions coincided with the eﬀectively calculable ones.e.5 G¨del’s Letter to Kreisel [1968] o -G¨del: letter to Kreisel of May 1. see A. 84]. 88]. “Some basic theorems on the foundations of mathematics and their implications. however.304–305].” . o o Martin Davis in his introduction wrote. 256–358. 1994. at a meeting of the American Mathematical Society at Brown University.4 G¨del on Church’s Thesis o G¨del may not have found errors in Church’s demonstration.” 3. that the lecture was the main project G¨del worked on in the fall of 1951.

of various mathematicians, they have taken on a much more satisfactory form than they had had originally. The greatest improvement was made possible through the precise deﬁnition of the concept of ﬁnite procedure, [“ . . . equivalent to the concept of a ’computable function of integers’ . . . ”] which plays a decisive role in these results. There are several diﬀerent ways of arriving at such a deﬁnition, which, however, all lead to exactly the same concept. The most satisfactory way, in my opinion, is that of reducing the concept of a ﬁnite procedure to that of a machine with a ﬁnite number of parts, as has been done by the British mathematician Turing.” In this one paragraph, 1. G¨del stressed the importance of the results to mathematics and phio losophy. 2. G¨del gave full credit to Turing and his “machine with a ﬁnite number o of parts” for capturing the concept of ﬁnite procedure. 3. G¨del never mentions Church or G¨del’s own deﬁnition of recursive o o functions. This is one of the most convincing and explicit demonstrations of G¨del’s o opinion of Turing’s work. 3.2.7 Godel’s Postscriptum 3 June, 1964 to G¨del [1934] o

-Godel’s Postscriptum 3 June, 1964 to G¨del [1934], see “The Uno decidable,” M. Davis, [1965, p. 71] and G¨del Collected Works, Volume I o [1986, p. 369–370]. “ In consequence of later advances, in particular of the fact that, due to A. M. Turing’s work, a precise and unquestionably adequate deﬁnition of the general concept of formal system can now be given, the existence of undecidable arithmetical propositions and the non-demonstrability of the consistency of a system in the same system can now be proved rigorously for every consistent formal system containing a certain amount of ﬁnitary number theory.”

18

Turing’s work gives an analysis of the concept of “mechanical procedure” (alias “algorithm” or “computation procedure” or “ﬁnite combinatorial procedure”). This concept is shown to be equivalent with that of a “Turing machine.”

3.3

Hao Wang Reports on G¨del o

Hao Wang was a very close friend and professional colleague of G¨del, whom o he called “G” in the following passage. Wang [1987, p. 96] wrote about G¨del’s opinion of Turing’s work. o “Over the years G habitually credited A.M. Turing’s paper of 1936 as the deﬁnitive work in capturing the intuitive concept [of computability], and did not mention Church or E. Post in this connection. He must have felt that Turing was the only one who gave persuasive arguments to show the adequacy of the precise concept . . . In particular, he had probably been aware of the arguments oﬀered by Church for his “thesis” and decided that they were inadequate. It is clear that G and Turing (1912–1954) had great admiration for each other, . . . “

3.4

**Kleene’s Remarks About Turing
**

“Turing’s computability is intrinsically persuasive” but “λ-deﬁnability is not intrinsically persuasive” and “general recursiveness scarcely so (its author G¨del being at the time not at all o persuaded).” -Stephen Cole Kleene [1981b, p. 49] “Turing’s machine concept arises from a direct eﬀort to analyze computation procedures as we know them intuitively into elementary operations. Turing argued that repetitions of his elementary operations would suﬃce for any possible computation. “ For this reason, Turing computability suggests the thesis more immediately than the other equivalent notions and so we choose it for our exposition.” -Stephen Cole Kleene, second book [1967, p. 233]

19

3.5

**Church’s Remarks About Turing
**

Computability by a Turing machine, “ has the advantage of making the identiﬁcation with eﬀectiveness in the ordinary (not explicitly deﬁned) sense evident immediately—i.e., without the necessity of proving preliminary theorems.” -Alonzo Church [1937], Review of Turing [1936]

In modern times it is sometimes stated as follows, recognizing that Church [1935], [1936] got it ﬁrst, but that Turing [1936] got it right, in the opinion of G¨del and many modern scholars. o Deﬁnition 3.2. Church-Turing Thesis. A function is intuitively computable if and only if it is computable by a Turing machine, or equivalently if it is speciﬁed by a recursive function. We strongly believe that it should not be called any of the three (Church’s Thesis, Turing’s Thesis, or the Church-Turing Thesis) but rather should be called the “Computability Thesis” as we argue in §13 and §14, just as the calculus is named for neither of its discoverers, Newton and Leibniz.

4

Oracle Machines and Relative Computability

After introducing deﬁnitions of computable functions: Turing a-machines, recursive functions, and λ-deﬁnable functions; the originators continued during 1936–1939 to explore incomputable phenomena, rather than computable applications of these devices, which came only a decade or more later. Church and Kleene [1936] as well as Church [1938] and Kleene [1938] studied computable well-orderings and deﬁned recursive ordinals which were later used to extend the jump operation to the arithmetic hierarchy and beyond CK to the hyperarithmetic hierarchy up to the ﬁrst nonrecursive ordinal ω1 . Turing spent 1936–1938 at Princeton working on a Ph.D. with Church. His thesis was completed in 1938 and published in Turing [1939]. Church and other mathematicians had found G¨del’s Incompleteness Theorem uno settling. By G¨del’s proof an eﬀective extension T1 of Peano arithmetic o cannot prove its own consistency conT1 . However, we can add the arithmetical statement conT1 to T1 to get a strictly stronger theory T2 . Continuing, we can get an increasing hierarchy of theories {Tα }α∈S over a set S of ordinals. Turing’s Ph.D. thesis [1939] concerned such an increasing array of undecidable theories.

20

As before. §4] a short statement about oracle machines. upon which is written the characteristic function of some set A (called the oracle). . It mostly lay dormant for ﬁve years until it was developed in a beautiful form by Post [1944].1. His description was only a page long and half of that was devoted to the unsolvability of related problems such as whether an o-machine will output an inﬁnite number of 0’s or not. Deﬁnition 4. [1948]. this oracle . will be developed in §7. With the help of the oracle we could form a new kind of machine (call them o-machines). 46] of a machine with a head which reads the work tape and oracle tape simultaneously.1 Turing’s Oracle Machines In one of the most important and most obscure parts of all of computability theory. a kind of oracle as it were. we complete this section §4. such as eﬀective continuity on Cantor space. S1 = {B. L} the set of 21 . 1} is the oracle tape alphabet. Q is a ﬁnite set of states. The old tape is called the work tape and operates just as before.6. In 1939 Turing left this topic never to return. Turing wrote in his ordinal logics paper [1939. and {R. S2 = {B. The reading head moves along both tapes simultaneously.” This is virtually all Turing said of oracle machines. . and whose symbols cannot be printed over.2 Modern Deﬁnitions of Oracle Machines There are several equivalent ways that a Turing machine with oracle may be deﬁned. 4. Before doing so. 1} is the work tape alphabet. .4. 0.1 with a modern treatment of oracle machines and Turing functionals including some of the more important properties even though these were mostly discovered much later. p. having as one of its fundamental processes that of solving a given number-theoretic problem. called the oracle tape. . and other papers as we shall explain in §5 and §6. “Let us suppose we are supplied with some unspeciﬁed means of solving number-theoretic problems. even after Post. More modern properties of Turing functionals. cannot be a machine. but many other formulations produce the same class of functionals. A Turing oracle machine (o-machine) is a Turing machine with an extra “read only” tape. We prefer the deﬁnition in Soare’s book [1987. .

γ and so forth for partial computable functionals and their use functions in many papers. and this is the general usage today. e Notation 4. (ii) We let upper case Greek letters represent partial functionals from 2ω to 2ω . and moves one space right (left) on both tapes if X = R (X = L). X) indicates that the machine in state q reading symbol a on the oracle tape and symbol b on the work tape passes to state p. The other details are just as previously in Soare [1987]. c. ψ represent partial functions from ω to ω and lower case Latin letters f . The Turing oracle program Pe takes some oracle A and deﬁnes a partial A-computable functional ΦA (x) = y. where δ(q. researchers have used ΦA (x) for the Turing functional with oracle program e Pe and have used ϕA (x) for the use function. A Turing oracle program Pe is now simply a partial map. On the other hand. b) = (p.head moving operations right and left. We let {Pe }e∈ω be an eﬀective listing of oracle Turing programs. If B ⊆ ω we write ΨA = B if ΨA (x) = B(x) for all x ∈ ω. δ : Q × S1 × S2 −→ Q × S2 × {R. e We refer to ϕe as a partial computable function ω to ω because its input and output are integers. (iii) As in Soare [1987] we use {Pe }e∈ω for an eﬀective listing of Turing programs for Turing a-machines and let ϕe be the partial computable function deﬁned by Pe . Γ. If ΦA is total and computes B we say B is computable in A and write B ≤T A. There is no confusion between the notation ϕe (x) as a partial computable function and ϕA (x) as a e use function for ΦA (x) because the former ϕe (x) will never have an exponent e A and the latter use function ϕA (x) always will. ψ. the maximum element of A e examined during the computation. Since Lachlan about 1970. g. (iv) Since Rogers book [1967]. prints “c” over “b” on the work tape. and let Φe be the computable partial functional deﬁned by Pe . (i) We let lower case Greek letters ϕ.2. a. researchers have used ϕe (x) or {e}(x) for the partial computable function with program Pe . Lachlan also used matched pairs Ψ. L}. and h represent total functions. ΦA is called a partial computable e functional because it takes a set A to a set B and is viewed as a map on Cantor Space 2ω . If A ⊆ ω then ΨA (x) may be deﬁned for some or all x. e 22 .

(1) ge = graph(ϕe ) =dfn { x. and does not read more of the oracle tape than σ during the computation. If Pe is an oracle Turing program deﬁning a Turing functional Φe .5. Here Φσ (x) = y denotes that the oracle program Pe with oracle σ on its e oracle tape.1 The Graph of a Partial Computable Function Deﬁnition 4. Given a partial computable (p.e. given any (c. The crucial property of the oracle graph Ge and the one which makes a Turing functional Φe independent of any particular machine representation is the following. set V which satisﬁes a singlevaluedness condition (3) and a continuity condition (4). function ψ and a description of its graph are interchangeable and equally powerful in describing ψ. (2) Ge =dfn graph(Φe ) =dfn { σ. subset Ve ⊆ We which is the graph of a p. 1 The converse holds for a c.4.c. 23 . Oracle Graph Theorem.2. eventually halts and outputs y. 4.c.2 The Graph of an Oracle Computable Functional Deﬁnition 4.) set We we can ﬁnd a single-valued c.3. y : ϕe (x) = y } Note that if ϕe is a partial computable (p.e. For an oracle machine program Pe we likewise deﬁne the oracle graph of the corresponding computable functional Φe but now taking into consideration the ﬁnite strings read by the oracle head during the computation.e.2. and x on its input tape.c) function ϕe deﬁne the graph of ϕe as follows. From the deﬁnitions Ge is Σ0 and therefore c. function.) function then graph(ϕe ) is a computable enumerable (c.c.4. then the graph Ge deﬁned in (2) is a computably enumerable (c. y : Φσ (x) = y } e where σ ranges over 2<ω . 4.e. Likewise. x.e.) set.e.3 The Oracle Graph Theorem Theorem 4.) set. Proof. The the notions of a Turing program to compute a p.

x. x.e. which is the central concept of the subject. If σ. (3) (4) σ. Proof. 4. any Turing a-machine can clearly be simulated by a Turing o-machine as we note in the following theorem.e.7. y ∈ U ]} = {x : (∃σ)(∃y)[ σ. Furthermore. Furthermore.6. in presenting the subject we can bypass a-machines altogether. or other variations.e. not the a-machine. This reinforces the claim that it is the o-machine. z ∈ V ]. y ∈ V σ. i. several authors deﬁne relative computability from oracle A by adding the characteristic function of A either to the Herbrand-G¨del o general recursive function deﬁnition or to the Kleene µ-recursive function deﬁnition. present o-machines. Given V satisfying (3) and (4) deﬁne a partial computable functional Ψσ (x) as follows. or two independent reading heads. Theorem 4. subset V ⊆ U satisfying (3) and (4) and having the same domain. Therefore. δ : Q × S2 −→ Q × S2 × {R.. Proof. and then draw a-machines as special cases. given any c. Now Pe consists of a ﬁnite partial map which can be identiﬁed with a set of 5-tuples. This includes an oracle machine with a single reading head reading the work tape and oracle tape. y ∈ V ]}. graph Ge and these deﬁnitions are all equivalent. This deﬁnes an eﬀective reduction Ψ. τ. {x : (∃σ)(∃y)[ σ. set U ⊆ 2<ω × ω × ω there is a c. In addition. then there is a Turing oracle program Pi which on input x and any oracle A produces the same output y.4 Equivalent Deﬁnitions of Relative Computability There are several diﬀerent formal deﬁnitions of relative computability. 24 . y ∈ V ]. Chapter II]. Similar to single valuedness theorem in Soare [1987.e. x. x. Proof. y ∈ V =⇒ =⇒ ¬(∃τ ⊇ σ)(∃z)[ z = y & (∀τ ⊃ σ)[ τ. x. Then there is a Turing functional Φe such that Ge = V . y appears in V deﬁne Ψσ (x) = y. Each of these formal deﬁnitions produces a c. If Pe is a Turing program for a Turing a-machine. Let Pe be a Turing program to compute ϕe .8. x. Theorem 4. L}. There must be a Turing oracle machine Φe such that Φe = Ψ. x.Theorem 4. Let V ⊂ 2<ω × ω × ω be a computably enumerable set which satisﬁes the following two conditions.

Note that the oracle Turing machine Φe is a ﬁnite object represented by an oracle program Pe or an oracle graph Ge and has no oracle associated with it. b. 5 Emil Post Expands Turing’s Ideas The spirit of Turing’s work was taken up by the American mathematician Emil Post. 1} the oracle tape alphabet as follows. S2 = {B. a) = (p.1 Notation for Functions and Functionals The standard notation is that given above. We recommend against using Φe to denote ϕe the partial computable function. This is unwise because it blurs the distinction of types in which ϕe operates on integers and Φe on sets. who had been appointed to a faculty position at City College of New York in 1932. X) for both c = 0 and c = 1. Furthermore. L} the set of head moving operations right and left. 4. but it can use any oracle A which may be attached. and {R.where Q is a ﬁnite set of states. The functional Φe is deﬁned by a program Pe which is a ﬁnite set of 6-tuples operating on sets. like a laptop computer whose link with the web has temporarily been removed. 1} is the work tape alphabet. X) for p. some researchers have unfortunately used Φe to denote ϕe .4. Deﬁne an oracle program Pi as follows with transition function δ : Q × S1 × S2 −→ Q × S2 × {R. This is analogous to a laptop computer with no active connection to a database which may later be connected to the World Wide Web. 25 . q ∈ Q and a. sometimes we would like to write Φe alone without its exponent A to identify it with Pe or its oracle graph Ge as a ﬁnite object. Remark 4. for S1 = {B. Hence. b. L}. a) = (p. there is no justiﬁcation for the necessity of Φe to denote ϕe since the current notation ϕe is quite satisfactory. while ϕe is deﬁned by Pe a ﬁnite set of 5-tuples operating on integers. For each line in Pe of the form δ(q. b ∈ S2 . 0.9. Furthermore. Recently. Doing so under the new convention leads to confusion with ϕe which is given by a diﬀerent type of program. Pi has exactly the same eﬀect on input x as Pe regardless of the oracle A. c. we add to oracle program Pi a line δ(q.

This was the mantle of clarity and intuitive exposition. Post’s contributions during the 1930’s were original and insightful. of why the intuitively computable functions are computable in his formal system. rather than a computational system as in general recursive functions or Turing computable functions. Furthermore. did not prove the unsolvability of the Entscheidungsproblem because at the time Post was not aware of Turing’s [1936]. as did Turing. his mantle fell on the shoulders of Post. because it gives an al- 26 . the mantle of exploring the most basic objects such as computably enumerable sets. and Post believed that Church [1936] had settled the Entscheidungsproblem. Post’s (normal) canonical system is a generational system. and most of all. and [1981. Post oﬀers only as a “working hypothesis” that his contemplated “wider and wider formulations” are “logically reducible to formulation 1. corresponding in spirit to Turing’s more than to Church’s. Post wrote [1936] that Church’s identiﬁcation of eﬀective calculability and recursiveness was working hypothesis which is in “need of continual veriﬁcation.5. Post did not attempt to prove that his formalism coincided with any other formalism. but they were not as inﬂuential as those of Church and Turing. Post gave no hint of a universal Turing machine. Post gave no analysis. of course. but in fact it was much less. Post [1941] and [1943] introduced a second and unrelated formalism called a production system and (in a restricted form) a normal system. 56]. It was only during the next phase from 1940 to 1954 that Post’s remarkable inﬂuence was fully felt. Post. Most important. p.” This irritated Church who criticized it in his review [1937b] of Post [1936]. which he explained again in [1944].2 Post Steps Into Turing’s Place During 1940–1954 As Turing left the subject of pure computability theory in 1939.1 Post’s Work in the 1930’s Post [1936] independently of Turing (but not independently of the work by Church and Kleene in Princeton) had deﬁned a “ﬁnite combinatory process” which closely resembles a Turing machine. From this it is often and erroneously written (Kleene [1987b. 61]) that Post’s contribution here was “essentially the same” as Turing’s. Post played an extraordinary role in shaping the subject. while Turing [1937b] proved the Turing computable functions equivalent to the λ-deﬁnable ones. p. such as general recursiveness. 5.” Lastly. the mantle of relative computability and Turing reducibility. During the next decade and a half from 1940 until his death in 1954. but merely expressed the expectation that this would turn out to be true.

e. [Post’s Thesis. p. p. this deﬁnition of normal set gives a new formal deﬁnition of computability which is formally equivalent to the deﬁnitions of Church or Turing. A nonempty set is eﬀectively enumerable (listable in the intuitive sense) iﬀ it is recursively enumerable (the range of a recursive function) or equivalently iﬀ it is generated by a (normal) production system.1 in the succinct form.e. 285]. Therefore. restated Post’s Thesis 5. p.” That is. Although he had used other terminology earlier. Post [1944.” (This is Church’s [1936] terminology also). but stated it in terms of generated sets and production systems.gorithm for generating (listing) a set of integers rather than computing a function. 286]. explained his informal concept of a “generated set” of positive integers this way. 201]. particularly for sets of positive integers. 1943. set as its range and from the deﬁnition of a c. normal sets are formally equivalent to recursively enumerable sets. and earmarked as belonging to the set. as a result of predetermined eﬀective processes.1. like Church and Turing. gave a thesis [1943. it stays there.) Post’s Thesis is equivalent to Turing’s Thesis. Post showed that every recursively enumerable set (one formally generated by a recursive function) is a normal set (one derived in his normal canonical system) and conversely. “Suﬃce it to say that each element of the set is at some time written down. (Equideﬁnable here means that from the deﬁnition of a partial computable function we can derive a c. like Church [1936]. set one can ﬁnd a single valued c. 27 . This led Post to concentrate on eﬀectively enumerable sets rather than computable functions. “The corresponding intuitive concept is that of an eﬀectively enumerable set of positive integers. Post. Deﬁnition 5.” Post then [1944.e. deﬁned a set of positive integers to be recursively enumerable if it is the range of a recursive function and then stated. which asserted that “any generated set is a normal set. 1944]. Post used the terms “eﬀectively enumerable set” and “generated set” almost interchangeably. p. Post [1944. Since recursively enumerable sets are equideﬁnable with partial computable functions. 286]. by the 1940’s Post had adopted the Kleene-Church terminology of “recursively enumerable set” for the formal equivalent of Post’s eﬀectively enumerable set. any eﬀectively enumerable set in the intuitive sense could be produced as a normal set is his formal system. It is understood that once an element is placed in the set. subset which is the graph of a partial computable function.

Post called G¨del’s diagonal set.e.) set W which is not computable but which cannot compute G¨del’s diagonal set K.“every generated set of positive integers is recursively enumerable. and even then only in general terms. Post later expanded on these deﬁnitions in [1948]. sets rather than partial computable functions may be even more fundamental than the thesis of Church and Turing characterizing computable functions because Sacks [1990] has remarked that often in higher computability theory it is more convenient to take the notion of a generalized c.E. Post himself was struggling to understand it. [1944]. 28 . even as little as presented above in §4.” Post’s concentration on c. Sets Post’s most inﬂuential achievement during this period was the extraordinarily clear and intuitive paper. every eﬀectively enumerable set of positive integers is recursively enumerable.e.e. o K = {e : e ∈ We } the complete set because every c. set We is computable in K (We ≤T K).” Post continued.3 Post’s Problem on Incomplete C. such that ∅ <T W <T K.” He remarked that “this may be resolved into the two statements: every generated set is eﬀectively enumerable.. Here Post introduced the terms degree of unsolvability and the concept that one set has lower degree of unsolvability than another. 5. In 1944 reo searchers did not understand Turing reducibility.e. i. 5.e. Post’s paper [1944] revealed with intuition and great appeal the significance of the computably enumerable sets and the signiﬁcance of G¨del’s o Incompleteness Theorem. Post felt that the creative property of K revealed the inherent creativeness of the mathematical process. and did not explicitly discuss it until the very end of his paper. “their converses are immediately seen to be true. Moreover. set as basic and to derive generalized computable functions as those whose graphs are generalized computably enumerable. Recursively enumerable sets of positive integers and their decision problems.4 Post Began With Strong Reducibilities Post posed his famous “Post’s problem” of whether there exists a computably enumerable (c.

” denoted B ≤T A.1 had been mostly ignored for ﬁve years. hyper-hypersimple.e. but the analysis holds for any set S2 . §11 General (Turing) Reducibility. Post resurrected in [1944] the concept of oracle machines which had been buried in Turing’s [1939] paper and which other researchers had apparently ignored for ﬁve years.e. Along with these strong reducibilities. §11]. First. set S2 in studying Post’s problem. sets with thin complements. hyper-simple. Post wrote it for a c. Turing’s notion of relative computability from an oracle discussed in §4. Post described the manner in which the decision problem for one set S1 could be reduced to that of a second set S2 . Post steadily continued gaining a deeper and deeper understanding from 1943 to 1954 until he had brought it to full development. Post deﬁned a sequence of strong reducibilities to better understand the concept of a set B being reducible to a set A. that Post deﬁned and named for the ﬁrst time “Turing Reducibility. in an attempt to ﬁnd an incomplete set for these reducibilities.e.1 Post Articulates Turing Reducibility Post wrote in [1944. 6 Post Highlights Turing Computability When Post wrote his famous paper [1944]. It was only at the end of Post’s paper [1944] in the last section. These concepts have pervaded the literature and proved useful and interesting. intuitive style as in the rest of the paper. persistent eﬀorts over a decade and a half than it is due to the brief remark by Turing in 1939. simple. Post’s four and a half page discussion there is the most revealing introduction to eﬀective reducibility of one set from another. Second. 29 . Post was able to exhibit incomplete incomputable c. and began to discuss it in intuitive terms. 6.Post’s contributions from 1943 to 1954 concerning relative computability are remarkable. sets for several of these stronger reducibilities but not for Turing reducibility. Our modern understanding of relative computability and Turing functionals is due more to Post and his patient. but they did not lead to a solution of Post’s problem. Slowly Post’s understanding deepened of the general case of one set B being reducible (Turing reducible) to another set A. Post deﬁned families of c. Post’s Problem stimulated a great deal of research in the ﬁeld and had considerable inﬂuence. In the same crisp.

§4] in the following extension of Turing’s ﬁrst Thesis 3.“Now suppose instead. Intuitively. A corresponding formulation of “Turing reducibility” should then be the same degree of generality for eﬀective reducibility as say general recursive function is for eﬀective calculability. Post-Turing Thesis. For the very concept of the decision problem of S2 merely involves the answering for an arbitrarily given single positive integer m of the question is m in S2 . the process would automatically continue to its eventual correct conclusion. says Turing [1939] in eﬀect. However.1. but it is largely implied by his presentation. It is even more surprising because relative computability is used much more often than 30 . there has been little analysis (along the lines of the extensive analysis of the Church-Turing Thesis 3.). That at certain times the otherwise machine determined process raises the question is a certain positive integer in a given recursively enumerable set S2 of positive integers.e.1 (because Ge is c. Post makes it explicit and claims that this is the formal equivalent of the intuitive notion of eﬀectively reducible.1 and Post’s ﬁrst Thesis 5. Post [1944. We could then say that the machine eﬀectively reduces the decision problem of S1 to that of S2 .” 6.2 for unrelativized computations) of what constitutes a relative computation of B from A.1. Turing’s brief introduction of oracles did not state this as a formal thesis. A set B is eﬀectively reducible to another set A iﬀ B is Turing reducible to A by a Turing oracle machine (B ≤T A).1. which is equivalent to Turing’s Thesis 3. this would correspond to the most general concept of reducibility of S1 to S2 .2 The Post-Turing Thesis Post’s statement may be restated in succinct modern terms and incorporates the statement implicit in Turing [1939. and that the machine is so constructed that were the correct answer to this question supplied on every occasion that arises. §11].” If we identify a Turing reduction Φe with its graph Ge both informally and formally then the Post-Turing Thesis is equivalent to Post’s Thesis 5. This is surprising because the Post-Turing Thesis was stated clearly in Post [1944]. and in a ﬁnite time but a ﬁnite number of such questions can be asked. Turing [1939 §4]. this situation obtains with the following modiﬁcation. a step as signiﬁcant as the Church-Turing characterization of “calculable. Deﬁnition 6.

1} and represent the set of such f as 2ω .2. i. 31 . C = N A = (2ω − NA ). The open sets of Cantor space are the countable unions of basic open sets. 1}. . (iv) Cantor space is 2ω with the following topology (class of open sets).e. (v) A set C is (topologically) closed if its complement NA is open.2 (i). The sets Nσ are called clopen because they are both closed and open. i.1. Deﬁne the string σy with canonical index y by σy (z) = 1 if z ∈ Dy and σy (z) = 0 otherwise. 7. σ ∈ T and τ σ imply τ ∈ T . applications of computability to other areas such as algebra. ﬁnite initial segments of functions f ∈ 2ω . model theory. (i) Using ordinal notation identify the ordinal 2 with the set of smaller ordinals {0. .e. We may assume A is closed upwards. algorithmic complexity and many more. using processes contained entirely inside the machine... Now T is closed downwards (because A is closed upwards). Let σ and τ represent ﬁnite strings in 2<ω and σ τ or σ f denote that σ is an initial segment of τ or f . 7 7. Also interactive or online computing in the real world is more common than batch processing or oﬄine computing. (iv) Set A ⊆ 2<ω is an open representation of the open set NA = σ∈A Nσ .ordinary computability in the theory of computability. (iii) Recall the deﬁnition of a ﬁnite set Dy with canonical index y where Dy = {x1 < x2 .2 Notation for Trees Deﬁnition 7. . In this case T =dfn 2<ω − A is a closed representation for C.1 Continuous and Total Functionals Representations of Open and Closed Sets Deﬁnition 7. analysis. Identify the sets A ⊆ ω with their characteristic functions f : ω → {0.e.e. (i) A tree T ⊆ 2<ω is a set closed under initial segments. < xk } and y = 2x1 + 2x2 . i. . For every σ ∈ 2<ω the basic open (clopen) set Nσ = { f : f ∈ 2 ω & σ f }. σ ∈ A and σ τ implies τ ∈ A. i. Hence. = 2xk .. (ii) Let 2<ω denote the set of ﬁnite strings of 0 s and 1’s. Fix any tree T .. we shall see that T forms a tree as in Deﬁnition 7. .

[ T ] = 2ω − NA and [ T ] is closed.3 there is a (nonunique) tree T ⊆ 2<ω such that C = [ T ]. Given any closed C with complement NA deﬁne T by putting σ in T if (∀τ σ)[ τ ∈ A ]. If C ⊆ 2ω is any closed set then by Theorem 7. (6) Tσ = { τ : σ τ or τ σ }. The closed sets are closed under ﬁnite union and countable intersection since the open sets have the dual properties in Deﬁnition 7. These properties can be proved from one another but here we give direct proofs of each. Theorem 7. (iii) For σ ∈ T deﬁne the subtree Tσ of nodes τ ∈ T comparable with σ. Then NA is open.3. The following very easy and well-known properties hold for Cantor Space 2ω . (i) K¨nig’s Lemma. then ∩i∈ω Ci = ∅ also. Proof. (iv) Finite subcover. The clopen sets are both open and closed. Usually for a given tree T there are many other trees T such that [ T ] = [ T ]. so any countable union of them is open and any countable intersection is closed. (=⇒). which is called a closed representation for C. and for every closed set C there is a tree T such that C = [ T ]. Then T is closed downward and [ T ] = C. (iv) Deﬁne the subtree of extendible nodes σ ∈ T . If T ⊆ 2<ω is an inﬁnite tree. . Any open cover {Nσ }σ∈A ⊇ 2ω has a ﬁnite open subcover {Nσ }σ∈F ⊇ 2ω for some ﬁnite subset F ⊆ A. then [ T ] is a closed set.e. i.4. Therefore. [Compactness]. If T is a tree. then [ T ] = ∅. The term “compactness” refers to any of them.e.(ii) The set of inﬁnite paths through T is (5) [ T ] = { f : (∀n) [ f n ∈ T ] }. closure under ﬁnite intersection and countable union. many diﬀerent representations for the same closed set [ T ]. Note that [ T ] is always a closed set. Theorem 7.. (7) T ext = { σ ∈ T : (∃f σ)[ f ∈ [ T ] ] } Note that if the tree T is computable then T ext is co-c. 32 . (⇐=). but particularly to (iv). then [ Tω ] = ∅. .1 (iii). Given tree T let A = 2<ω − T . is a decreasing sequence of trees with [ Tn ] = ∅ for every n. and intersection Tω = ∩n∈ω Tn . (iii) If {Ci }i∈ω is a countable family of closed sets such that ∩i∈F Ci = ∅ for every ﬁnite set F ⊆ ω. o (ii) If T0 ⊇ T1 .

e. (Both Cantor space and Baire space are separable. This is the paradigm for the ﬁnite extension constructions in computability theory and oracle constructions as Kleene and Post. (iv) A space S is separable if it has a countable base of open sets. (i) (computably) open. or equivalently if C = [ T ] for a computable tree T ⊆ 2<ω . if B = ∩i Ai a countable 2 intersection of open sets Ai . If the open sets Ai are also dense open. then f is a limit point. then A is eﬀectively Deﬁnition 7. σ) [ f ∈ A ]. which we use to construct sets and degrees meeting an countable sequence of “requirements. (i) A set A ⊆ S is dense if (∀σ) (∃f (ii) A set A ⊆ S is dense open if (8) (∀τ )(∃σ τ )(∀f σ) [ f ∈ A ]. (iii) Let T ⊆ 2<ω be a tree. especially the Finite Extension Paradigm of Kleene and Post.6. i. much attention is paid in point set topology to Gδ sets (see Oxtoby[1971]).e. (iii) (10) C ⊆ 2ω is a Π0 class if there is a computable relation R(x) such that 1 C = {f : (∀x) R(f (x))}.e. then C is eﬀectively (computably) closed .. We say that σ isolates f because Nσ ∩ [ T ] = { f }. then they have special signiﬁcance.3 Dense Open Subsets of Cantor Space Deﬁnition 7. If f is not isolated. Let S be Cantor space 2ω or Baire space ω ω . After open and closed sets. (ii) If C = 2ω − NA for A c. and A = NA ..7. 7. 33 .) (v) A class B ⊆ S is Gδ .” Meeting a given requirement Ri amounts to meeting the corresponding dense open set Ai .5. A point f ∈ [ T ] is isolated in [ T ] if (9) (∃σ)[ [ Tσ ] = { f } ]. Banach-Mazur games can be used for ﬁnding a point f ∈ ∩i Ai where the the sets Ai are dense and open.4 Eﬀectively Open and Closed Sets If A ⊆ 2<ω is c. boldface Π0 .

e. if we ﬁx A as a parameter. Deﬁne a computable tree T = { σ : (∀τ ⊆ σ)[R(τ )] }. (But this entire 1 section is about working relative to an oracle. Proof. Hence.. i. Here RS denotes a relation computable in the set S 1 which we call the parameter determining RS .5 Continuous Functions on Cantor Space In elementary calculus courses a continuous function is usually deﬁned with δ and concepts or with limits. eﬀectively open relative to the oracle A. In advanced analysis or topology courses 34 . A class C is a Π0 class iﬀ C is eﬀectively closed. 1 1 Theorem 7.We call this lightface Π0 because it is deﬁned in (10) by a universal quantiﬁer 1 outside of a computable relation R(x). (⇐=). A set A ⊂ 2ω is boldface Σ1 or ΣS if its complement 2ω − A is boldface Π1 or ΠS . construction of an A-c. If A is open.e.7. Then [ T ] = C. The open (closed) sets of 2ω are exactly the boldface Σ1 (Π1 ) sets and any boldface set is lightface in some parameter A. then the deﬁnition and properties become lightface ΣA . such as the Recursion Theorem.) We often convert an open set A = NA into the realm of computability theory as follows. (=⇒).8. then A = NA for some countable set A. set B. Theorem 7. Proof. and (3) replace the closed set by C = [ T A ] for a A-computable tree T . C = [ T ] 1 for some computable tree T . (iv) A set C ⊆ 2ω is boldface Π1 if there is some set S ⊆ ω such that C = {f : (∀x) RS (f (x))}.. By ﬁxing the parameter A we can apply all the methods of this chapter on A-computable constructions. i. Then {f : (∀x) R(f (x))} = [ T ]. Let C = { f : (∀x) R(f (x)) } for R computable. 7. Now A determines exactly which σ contribute in the countable union A = ∪σ∈A Nσ . We: (1) usually ﬁx the parameter A and do a construction which is computable relative to the parameter A. Deﬁne R(σ) iﬀ σ ∈ T .e. (2) often replace the open set NA by its complement the closed set C = N A . Let C = [ T ] for T a computable tree. and so forth. and we say C is in ΠS .

(⇐=). For arbitrary topological spaces an open set is an arbitrary union of basic open sets.e. (=⇒). 7.11.9. Assume Ψ is total. we can replace every set Xτ by a ﬁnite subset Xτ . Theorem 7. Theorem 7. i. and uniformly so in the sense that there is a computable e function h(e. Let Ψ be a continuous functional on Cantor Space 2ω .the more general deﬁnition is presented that a function F is continuous iﬀ the image of every basic open set is open. (i) A functional Ψ on Cantor space 2ω is continuous if for every τ ∈ 2<ω there is a countable set Xτ such that (11) Ψ −1 (Nτ ) = ∪ { Nσ : σ ∈ Xτ }. By identifying string σy with code number y deﬁned in Deﬁnition 7. Then for every τ there is a countable set Xτ which covers 2ω in the sense of (12). although it is usually presented in its eﬀective analogue as the theorem that Φe is total iﬀ it is a truth-table reduction. Then Ψ is total iﬀ for each set Xτ of (11) there is a ﬁnite subset Xτ ⊆ Xτ such that.6 Eﬀectively Continuous Functionals A Turing functional Φe is not only continuous but eﬀectively continuous in the following sense. For Φe deﬁne for every τ ∈ 2<ω the set of strings e (13) Xτ = { σ : (∃s)( ∀x < |τ | ) [ Φσ (x) ↓ = τ (x) ] }. Therefore. Given such Xτ for every τ we see that Ψ is total by (12). τ ) such that Wh(e. Proof.10. Deﬁnition 7. if (∀A)(∃B)(∀x)[ ΨA (x) = B(x) ]. (12) 2ω ⊆ ∪ { Nσ : σ ∈ Xτ }. Now the Compactness Theorem asserts that any open cover of Cantor space 2ω has a ﬁnite subcover.1 (iii) we can think of Xτ as a subset of ω. 35 .e. (ii) A functional Ψ on Cantor space 2ω is total if ΨA (x) is deﬁned for every A ⊆ ω and x ∈ ω.τ ) = Xτ ..s e Then Xτ is c. Note that this involves only compactness and has no computable content. but for Cantor space we may take countable unions. e. We state continuity now for functionals on the Cantor space 2ω .

7. Therefore... if B ≤m A via a computable function f (x) then this reduction is bounded by h(x) = f (x) and x ∈ B iﬀ σ(f (x)) = 1 where σ A. For example. Now the set of e strings { Xτ : τ ∈ 2ω } witnesses that the functional Φe is continuous.Proof. indeed eﬀectively continuous. where σ is an initial segment of A. Since Xτ is not only countable but also computably enumerable uniformly in e the functional Φe is eﬀectively continuous. This gives a method for indexing the rows σy ∈ Mx . Given e h(x) imagine a matrix Mx whose rows are all the strings σ of length h(x). In §8. 8 8. Theorem 7.e. In Deﬁnition 7.7 Continuous Functions are Relatively Computable We showed that any Turing functional is continuous. Now we prove that any continuous functional on 2ω is a Turing functional relative to some real parameter X ⊆ ω and therefore is eﬀectively continuous relative to X. i. Identify string σ with Nσ . only the matrix Mx . Then Ψ is a Turing functional relative to some real parameter X ⊆ ω. Use the Oracle Graph Ge . Since Ψ is continuous. that e Xτ is a computably enumerable set of strings.e.e. ϕA (x) ≤ h(x). We begin in §8..2 with the most general bounded reducibility called bounded Turing reducibility (B ≤bT A) where we are given only the computable bound h(x).1 Bounded Reducibilities A Matrix Mx for Bounded Reducibilities A bounded reducibility is a Turing reducibility ΦA (x) with a computable e function h(x) which bounds the use function. Ψ−1 ( Nτ ) = ∪ { Nσ : σ ∈ Xτ }.13. i.3 we study the more 36 .12. (identifying strings σ with their code numbers as integers) there is a set Xτ ⊆ ω such that.1 (iii) we deﬁned σy to be the string with canonical index y derived from Dy . the inverse image of every basic open set Nτ . i. τ ∈ 2<ω . is open and therefore is a countable union of basic open sets. e Deﬁnition 7. Suppose Ψ is a continuous functional on 2ω . i. Hence.e. the set X = ⊕{Xτ : τ ∈ 2<ω } provides a complete oracle for calculating Ψ : 2ω → 2ω . Proof. The action on x is entirely determined by the action of Φσ (x) for these rows e σ ∈ Mx ..

ibT has occurred in applications of computability to differential geometry in Soare [2004] and Csima-Soare [ta]. 8. and ibT reducibility has also been used in applications to algorithmic randomness and Kolmogorov complexity. nitions of tt-reducible are equivalent. e (ii) A set B is identity bounded Turing reducible to A (B ≤ibT A) if B ≤bT A with h(x) = x. and hence B ≤ibT A. set A and we construct a simple set B ≤T A by simple permitting where an element x is allowed to enter B at stage some stage only if some y ≤ x has just entered A. The bT and ibT reductions occur naturally in several parts of the subject. Nerode]. A set B is truth-table reducible to set a A (B ≤tt A) if B ≤bT A via ΦA = B and h(x) as in Deﬁnition 8.2 Bounded Turing Reducibility Deﬁnition 8.2.3 Truth-Table Reductions Deﬁnition 8.3 (iii). For example. 8. (i) A set B is bounded Turing reducible (bT-reducible) to a set A (B ≤bT A) if there is a Turing reduction ΦA = B and a computable e function h(x) such that the use ϕA (x) ≤ h(x). [Truth-Table Theorem. More recently. When A x has settled then B x has settled also.1. The following deﬁ- Theorem 8. If Φσ (x) diverges for even one x and e σ ∈ Mx then the reduction is a partial bT-reduction. sets.1. but if it converges for every x and every σ ∈ Mx then it gives a genuine truth-table as in beginning logic courses as deﬁned in Theorem 8. as described later.e.restrictive case of truth-table reducibility (B ≤tt A) where Φσ (x) converges e for every x and every row σ ∈ Mx . e e e 37 . Barmpalias and Lewis [ta] have shown the nondensity of the ibT -degrees of c. (i) B ≤tt A as deﬁned in Deﬁnition 8.3.e. This convergence on all strings σy ∈ Mx is the key deﬁning property for a tt-reduction as expressed in (14). and also e (14) (∀x)(∀σ)[ |σ| = h(x) =⇒ Φσ (x) ↓ e ]. often we are given a noncomputable c.2 and (14). (ii) ΦA = B for some total ΦX that is (∀X)(∃Y )(∀x)[ ΦX (x) = Y (x) ].

Uniformly in x we can eﬀectively enumerate the set Ux = { σ : Φσ (x) ↓ }.2 above where we could attach to matrix Mx an extra column with the value Φσ (x) on row σ.2. Proof. Property (iv) of B ≤tt A has been used in the 38 .(iii) B ≤tt A via ΦA and h(x) as in Deﬁnition 8. σ Remark 8. (iii) =⇒ (i). σ (iv) There exist computable functions g and h such that. . there is a e computable function g(x) such that Dg(x) = { y : |σy | = h(x) & Φe y (x) = 1 }. Letting h(x) be the maximum of the {mi }i≤k .4. In addition. §6] introduced the ﬁrst deﬁnition of B ≤tt A. ﬁlling in all columns / less than h(x). Deﬁne h(x) and g(x) by h(x) = max{ |σ| : σ ∈ Vx }. . Therefore.4 (iv) to get a ﬁnite subset Vx ⊆ Ux such that ∪{ Nσ : σ ∈ Vx } ⊇ 2ω . m2 . Post’s extra column converted the matrix Mx into a total reduction because A had to extend exactly one of the rows Rz and then the value for B(x) was completely speciﬁed by vz given in advance. e Since Φe is total apply the Compactness Theorem 7. and (iii) ⇐⇒ (iv) are obvious. mk . The implications (i) =⇒ (ii). Post’s original deﬁnition [1944] of B ≤tt A is virtually identical in intuition and description to our Deﬁnition 8. It remains to prove (ii) =⇒ (iii). (ii) =⇒ (iii).1. . In both cases the e crucial point is that Φσ (x) is deﬁned for every string of length h(x) before e examining the oracle A. Next Post drew a vertical line to the right of this matrix and added an extra column such that an entry vz in this column following row Rz indicated that if A satisﬁes row Rz then x ∈ B iﬀ vz = +. . Dg(x) = { y : |σy | = h(x) & Φe y (x) = 1 }. . mk and 2k rows with individual entries of + for x ∈ A and − for x ∈ A. x ∈ B ⇐⇒ (∃z ∈ Dg(x ) [ A (h(x) + 1) = Dz ]. For every integer n he required a eﬀective procedure to produce integers k. and replacing + by 1 and − by 0 we have exactly the matrix Mx described in §8. . and m1 . He then drew a diagram of a matrix with columns m1 . Post [1944. for all x.

Thus. sets. the 1-c. The concept of tt-reducibility is tied to the totality of the reduction ΦA which is exactly what bT-reducibility lacks. the concept of wtt has distance two from the central concept ≤T .e. sets are the d.e.e.5.e. 39 . The next theorem gives an elegant characterization of ω-c. sets (d.6.e.e. Theorem 8. 8. and the 2-c. Therefore. p.e. sets. e Also bT is more recognizable than wtt whose meaning cannot be guessed from its name. Soare [1987.e.c. which has the same deﬁnition as wtt. goes immediately to the main concept of bounding the queried information by a computable function h(x). sets are the usual c. For example. sets.. (ii) A is ω-c. (15) A = lims As & | { s : As (x) = As+1 (x) } | ≤ g(x). The following are equivalent. sets. sets The Limit Lemma characterized sets A ≤T ∅ as those such that A = lims As for a computable sequence {As }s∈ω . (i) A ≤bT ∅ .past e. (i) A set D is the diﬀerence of c. Now consider special cases based upon how many times the approximation changes on x. sets A but not the most general case of A ≤T ∅ .e..c.) if there is a computable sequence {As }s∈ω with A0 = ∅ and a computable function g(x) which bounds the number of changes in the approximation {As }s∈ω in the following sense. ≤bT has distance one from the main reducibility of ≤T . in 1959 Friedberg and Rogers introduced wtt-reducibility (B ≤wtt A) as a weakening of tt-reducibility which was already a strengthening of ≤T .e.4 Diﬀerence of c.e.e.e. the only 0-c.e.e. 83] and is short and slick but is does not give the necessary elegance and intuition for beginning students. set is ∅.g. Turing reducibility was not well understood in 1944 and an understanding of it in its modern state emerged only gradually during the 1940’s and 1950’s. and ω-c. n-c.) if D = A − B where A and B are c. (iii) A ≤tt ∅ . (ii) The set A is omega-c.e. These notions are more general than c. Deﬁnition 8. Post’s tt-reducibility in 1944 was understood at once. if g(x) ≤ n. Therefore. (written ω-c. (iii) For n ∈ ω the set A is n-c. sets.e. The concept of bounded Turing reducibility (bT).

and |C [x] | ≤ g(x) by hypothesis (ii).e. (ii) =⇒ (iii). (Intuitively. C ≤m 0 and therefore A ≤tt 0 . because the approximation changes between 0 and 1 starting with 0. |C [x] | is the number of changes on x during the approximation. Assume A = lims As satisﬁes (15) via g(x). Furthermore.e. Let e e As (x) = Φ∅ (x)[ s ] where we may speed up the computation so the latter is e always deﬁned.) Therefore.. Next ﬁnd the row with k many 1’s. Second. This case is unusual since most reductions we consider only produce A ≤T B for some set B and sometimes produce A ≤bT B as in permitting arguments. The Turing o-machine is a better model to study them because the Turing a-machine lacks this online capacity. Now A(x) = 1 iﬀ k is odd. in recent years the implementations have been increasingly online computing devices which can access or interact with some external database or other device. Now to tt-compute from C whether x ∈ A compute k = |C x |.2 (ii). C is c. This ensures that A ≤tt D. 1} rather than in ω. x . Deﬁne the c. First. Now As+1 (x) = As (x) only if some element z ≤ g(x) enters ∅ which can happen at most g(x) + 1 times. change set C by C={ k. Suppose Φ∅ = A with computable bound g(x) ≥ ϕ∅ (x). This result shows the diﬀerence between T -reductions and tt-reductions. (i) =⇒ (ii). However. the approximation always begins with As (x) = 0 for s = 0 and changes between 0 and 1 because all values are in {0. whenever As (x) = As+1 (x) we put into C the least element of the form k. For each k ≤ g(x) construct a row beginning with k many 1 s followed by all 0 s. i.Proof. once for each z ∈ [0. A(x) = 1 iﬀ |C [x] | is odd. Therefore. Hence. A ≤tt C. x : 1 < k ≤ | {s : As (x) = As+1 (x)} | }. First build a truth-table to demonstrate that A ≤tt C. However. Clearly. For a given x the truth-table has rows of width g(x) as in Deﬁnition 8.e. 9 Online Computing The original implementations of computing devices were generally oﬄine devices such as calculators or batch processing devices. Hence. on row ω [x] . we can make up a row in the truth-table which gives value for A(x) based only on the number of changes. g(x)]. 40 . not already in C. the assumption on h(x) ensures that A ≤bT D. (iii) implies (i).

not interacting with any external device. A simple model of interactive computing is presented consisting of one component and an environment. In [Goldin-Smolka-Wegner] a chapter by Yuri Gurevich.1 these real world online or interactive processes can be described by a Turing oracle machine. ﬁnitary models of computation. (ii) An oﬄine computing process is one which begins with a program and input data.Deﬁnition 9.1. and broadens the notion of algorithms to include interaction by allowing intra-step interaction of an algorithm with its environment. who fed them to the computer and produced paper output later. Gurevich asserts that computer science is largely about algorithms. Interactive Algorithms 2005 is described. and batch processing devices where a user handed a deck of punched IBM cards to an operator. In real world computing the oracle may be called a database or an environment. A Theory of Interactive Computation by Jan van Leeuwen and Jiri Wiedermann.” It appears that the Turing o-machine is a good theoretical model to analyze an interactive process because there is usually a ﬁxed algorithm or procedure at the core.” 41 . interacting using single streams of input and output signals. and there is a mechanism for the process to communicate with its environment. which by Turing’s thesis we can identify with a Turing a-machine. In the real world the database would not be literally inﬁnite but may appear so (like the web) and is usually too large to be conveniently downloaded into the local computer. which when coded into integers may be regarded as a Turing type oracle. “This chapter asks what a computational theory of interactive. Under the Post-Turing Thesis 6. (i) An online or interactive computing process is one which interacts with its environment. Sometimes the local computer is called the “client” and the remote device the “server. and proceeds internally. evolving programs should look like. This includes a calculator. There are many descriptions in the computing literature about online and interactive processes. the book states. for example a computer communicating with an external data base such at the World Wide Web. “In this chapter. The authors point out that a theory of interactive computation must necessarily lead beyond the classical. A laptop obtaining data from the World Wide Web is a good example.” About the chapter.

e. there are many computing processes in the real world which give a sequence of approximations to the ﬁnal answer. 1947. Christof Teuscher [2004]. February 20. Discussing only Turing a-machines in modern texts. • A large number of books presenting an introduction to computability mention Turing oracle machines and relative computability very late in the book or not at all. that o-machines are online while a-machines are not. • A large number of books with articles on Turing and the ChurchTuring Thesis do not mention Turing oracle machines or relative computability at all.1 Turing Machines and Online Processes We could continue analyzing to what extent Turing oracle machines can model modern online processes. Turing considered machines which make mistakes.2 Trial and Error Computing We expect Turing a-machines and o-machines to be absolutely correct. or only the ChurchTuring Thesis. even a universal machine. quoted in Hodges.g. In his talk to the London Mathematical Society. p. but let us now examine the reverse direction. The following points appear self-evident. “I would say that fair play must be given to the machine.9. A Turing a-machine. and not the Post-Turing Thesis on oracle computers. • Turing oracle machines are online. 360–361. • The original Turing a-machines are not online. Instead of it sometimes giving no answer we could arrange that it gives 42 . See the authors in [GoldinSmolka-Wegner] for only a few. An o-machine has ﬁxed program but has the capacity to interact with its environment and receive new data during its computation. 9. However. • A large number and rapidly increasing number of computing processes in the real world are online or interactive. is like discussing only batch processing machines of the 1950’s long after the emergence of online computing.. Turing said. begins with a ﬁxed program and ﬁxed input and proceeds without further outside input until (if ever) it halts.

Hillary Putnam [1965] described trial and error predicates as ones for which there is a computable function which arrives at the correct answer after a ﬁnite number of mistakes.e. (In practice. that is. equivalent. It is easy for us to regard these blunders as not counting and give him another chance. (ii) B is limit computable.6. There are several theorems which say exactly that. Deﬁnition 9. 9. it cannot also be intelligent. a meteorologist predicting the weather a week from now given constantly updated weather conditions today. (See Soare [1987] or Soare [CTA] Lemma 3. [Limit Lemma. This is a model for many processes in the real world which allow ﬁnitely many mistakes but gradually move closer to the correct answer.) Now in the real world imagine an example of a computing process with error such as: a robot learning a maze.3 The Limit Lemma There are several diﬀerent approaches for computing with ﬁnite errors.2. But these theorems say nothing about how much intelligence may be displayed if a machine makes no pretence at infallibility. “oracle set” A. (iii) B ∈ ∆2 . If there is such a sequence we say that B is limit computable.3. Proof. Lemma 9. B is is both two quantiﬁer forms. Shoenﬁeld. In other words if a machine is expected to be infallible. A computable sequence of computable sets {Bs }s∈ω is a computable (∆0 ) approximating sequence for a set B if B = lims Bs . the ﬁnal answer may not be 43 The following are . But the human mathematician would likewise make blunders when trying out new techniques. a ﬁnancial trader receiving information from around the world updated every second. but the machine would probably be allowed no mercy. In our idealized model we assume that the individual makes ﬁnitely many errors during the process {Bt }t∈T for time periods t ∈ T but eventually gets the correct answer.occasional wrong answers. 1959]. In modern terminology this is called a limit computable function as described in Soare [1987] or Soare [CTA] Chapter 3. (i) B ≤T A for some c.3.

the conﬁguration of his computation at the end of time t.4 9. How will the trader write a program to uniformly compute the index gt for t ∈ T ? 9. meteorology. but is presumably more accurate than the ﬁrst approximation B0 . Turing a-machine model. The conﬁguration at his trading desk may be described using the Limit Lemma by a computable function where gt is the computable characteristic function of Bt . He does not (and cannot) change the program Φe every second.) 9.4. Every second t ∈ T he receives from New York and abroad the latest quotes At which enter directly into his computer by an internet connection. 44 .4. set A (or even a ∆0 set) and oracle 2 machine Φe such that B = ΦA . instead of an online model.e. It is diﬃcult to see how this trader could have carried out his business using a batch processing. There is not necessarily any connection between diﬀerent programs and we may have to compute all over again with a new program as we pass from time t to t + 1. Now the trader can program the algorithm e Φe into his laptop once and for all at the start of the trading day. even if not exact. Milan.2 The Online Model By the Limit Lemma there is a c. His algorithm simply receives the “oracle” information At from the internet as it is continually updated. are usually useful in ﬁnancial trading. Suppose the ﬁnancial trader in Chicago receives data every second t ∈ T about currency prices in London. The sequences of improving approximations. New York and Tokyo. The computable function gt gives an algorithm to compute the condition Bt at time t but it gives no relationship between Bt and Bt+1 . It will not be possible for the trader to write a new program every second. and other approximations in real time.exactly correct in these examples.1 Two Models for Computing With Error The Limit Computable Model In the limit computable or approximation model we have a sequence of Turing programs {Pt : t ∈ T } so that Pt computes function gt at time t ∈ T . and computes the approximation Bt (x) = ΦAt (x). His program e then executes a trade when the algorithm determines that conditions are favorable.

“Dedicated to S. Kleene later o introduced the term “recursive function theory” for the subject although G¨del disagreed (see below). These items may have been displaced accidentally or without conscious thought or decision. These issues are at the very heart of the subject and they deﬁne how we think about computability. G¨del.10 Three Displacements in Computability Theory The dictionary deﬁnes “displacement” to be the moving of something from its rightful place or position. Church and Kleene used the term “recursive” to mean “computable” even though Turing and G¨del later objected. simply acting from the exigencies of the situation at the time. often when replaced by something else.” This is entirely accurate and without Kleene’s leadership we would not have the ﬁeld as we know it today. but are not consistent with a careful scientiﬁc analysis later. that were not consistent with the original development of computability in the 1930’s and would not have been approved of by G¨del and Turing.” After 1996 the term the term ‘recursive” was again used only to mean “inductive” not “computable” or 45 .C. There are three important issues in computability which have at one time been displaced from their correct or proper positions as evaluated by historical and scientiﬁc criteria. After 1940 the ﬁeld was developed and promulgated primarily by Stephen C. perhaps by accident. a number of changes took place after 1940. When computabiliy theory originated in the 1930’s it was a very small ﬁeld attempting to consolidate its ideas. In dedicating his book Degrees of Unsolvability [1971] Shoenﬁeld recognized Kleene’s overwhelming inﬂuence. We now examine these three issues one by one in the next three sections. Furthermore. o 11 “Computable” versus “Recursive” Starting in 1936. Turing. Kleene who made recursive function theory into a theory. Kleene with some additional inﬂuence by Emil Post as described earlier.D. although Church supervised the Ph. theses of many prominent researchers in the ﬁeld. However. This was the ﬁrst time in history that the o term “recursive” which had meant roughly “inductive” acquired the additional meaning “computable” of “calculable. three of its leaders. and Church eﬀectively left the ﬁeld after 1940 and had little o direct inﬂuence thereafter on its development.

This was not because of the inadequacy of λ-deﬁnable functions in comparison to the recursive functions. chose.” The irony is that the term “computable” was there all along and was preferred by Turing and G¨del. After seeing G¨del’s lectures in 1934 Church and Kleene dropped o the λ-deﬁnable functions and adopted the recursive functions.” When G¨del strongly rejected to o this thesis Church turned instead to G¨del’s own Herbrand-G¨del general o o recursive functions as a formalism and proposed in [1935] and [1936] the well-known form of his thesis. Church was very eager for mathematicians to accept his thesis and he know that the recursive functions were more familiar to a mathematical audience than λ-deﬁnable ones. .1 (First Version) [1934] “A function is eﬀectively calculable if and only if it is λ-deﬁnable. Church and Kleene used the second version of Church’s Thesis above.“calculable. to put my work in that format.2 Church and Kleene Deﬁne “Recursive” as “Computable” By 1936 Kleene and Church had begun thinking of the word “recursive” to mean “computable. Indeed Church seems to have preferred the λ-deﬁnable functions and caused Turing to write his thesis [1939] in that formalism.” From 1931 to 1934 Church and Kleene had used the λ-deﬁnable functions as the formal equivalent of eﬀectively calculable functions.2 [1936] A function on the positive integers is eﬀectively calculable if and only if it is recursive. o 11. perhaps unduly inﬂuenced by rather chilly receptions from audiences around 1933–35 to disquisitions on λ-deﬁnability. after general recursiveness had appeared. this is exactly what caused the change in 1996 from “recursive” back to “computable” because in 1996 the term “computable” was much better understood by a general audience than “recursive.1 Church Defends Church’s Thesis with “Recursive” Recall Church’s Thesis 2. “I myself. Church and Kleene knew almost immediately and published by 1936 the proof of the formal equivalence of recursive functions with λ-deﬁnable functions. . phrased in terms of recursive functions primarily for public relations as Kleene [1981] explained. . arrange the work in a framework which will be understandable and appealing to as large a scientiﬁc audience as possible. and Church had ﬁrst proposed his thesis privately to G¨del in that form.” Church had seen his ﬁrst thesis rejected by G¨del o and was heavily invested in the acceptance of his 1936 thesis in terms of 46 . Church’s Thesis 2. Ironically. o 11. ” Church and Kleene were simply doing what most scientists do.

So few people understood the meaning of “recursive” that by 1990 I had to begin my papers with.” In the same year Kleene [1936. [1944] of “effectively generated set. p.” “normal set.” Thereafter. Davis related. Without the acceptance of this thesis Church had no unsolvable problem. 47 . Most people access to a personal computer on their desks and the terms of computing were familiar to the general population but “recursive” was limited to very small number who mainly associated it with a ﬁrst year programming course or a deﬁnition by induction on mathematics and almost never with computability. 11. This is apparently the ﬁrst appearance of the term “recursively enumerable” in the literature and the ﬁrst appearance of “recursively” as an adverb meaning “eﬀectively” or “computably.” as if I were writing in Chinese and translating back into English. when others did G¨del reacted sharply negatively.” (See Peter’s work on recursions in [1934] and[1951]. By a “recursive enumeration” Kleene states that he means “a recursive sequence (i.” G¨del never used the term “recursive function theory” to name o the subject. In a discussion with G¨del at the Institute for Advanced Study in o Princeton about 1952–54. adopted this terminology of “recursive” and “recursively enumerable” over his own terminology [1943]. saying that the term in o question should be used with reference to the kind of work Rosza Peter did. 238] cited in Davis [1965] [p.e.) By 1990 the situation had become very diﬃcult. a computable function).. it was ﬁrmly established.” “generated set. Martin Davis casually used the term “recursive function theory” as it was used then.recursive functions. Church wrote in [1936. as related by o Martin Davis. 238] mentioned a “recursive enumeration” and noted that there is no recursive enumeration of Herbrand-G¨del systems of equations which gives only the o systems which deﬁne the (total) recursive functions.3 G¨del Rejects “Recursive Function Theory” o Neither Turing nor G¨del ever used the word “recursive” to mean “como putable. p. “Let f be a recursive function (that is. “To my surprise. the successive values of a recursive function of one variable).” Post [1944]. G¨del reacted sharply. under the inﬂuence of Church and Kleene. 96] printed in Davis [1965] that a “recursively enumerable set” is one which is the range of a recursive function.

then one is never sure whether a particular instance means “calculable” or “inductive” and our language has become indistinct. the Greeks and other early civilizations. conference in Boulder. Colorado referenced in Soare [2000]. The object of 48 . However. had adopted the new terminology and conventions. “The recognition of algorithms goes back at least to Euclid (c. Historical Accuracy. especially those under forty years old.S. most researchers.) set” did not come tripping from the lips. Changing back from from “recursive” to “computable” during 1996–1999 has had a number of advantages. 11.” “Recursive” should mean “inductive” as is had for Dedekind and Hilbert. Three years later at the A. overturning a sixty year old tradition of Kleene. p. “I think we can say that recursive function theory was born there ninety-two years ago with Dedekind’s Theorem 126 (‘Satz der Deﬁnition durch Induktion’) that functions can be deﬁned by primitive recursion.).e.” We already have one. and the words “computability theory” and “computably enumerable (c.11.M.4 The Ambiguity in the Term “Recursive” The traditional meaning of “recursive” as “inductive” led to ambiguity. Kleene [1981b. We do not need another word to mean “computable. 19] where he wrote.C. The founders of the two key models of computabilty. At ﬁrst few were willing to make such a dramatic change. 330 B.” Did he mean that recursion and inductive deﬁnition began with Dedekind or that computability and algorithms began there? The latter would contradict his several other statements. in a few months more people were convinced by the undeniable logic of the situation. Turing and G¨del. had never used “recursive” to mean como putable and indeed had objected when it was so used. I wrote an article on Computability and Recursion for the Bulletin of Symbolic Logic [1996] on the history and scientiﬁc reasons for why we should use “computable” and not “recursive” to mean “calculable. such as Kleene [1988.5 Changing “Recursive” Back to “Inductive” By 1996 the confusion had become intolerable. 44] wrote. Kleene often wrote of calculation and algorithms dating back to the Babylonians. Returning “recursive” to its original meaning of “inductive” has made its use much clearer.” When one uses a term like “recursive” to also mean “computable” or “algorithmic” as Kleene did. However. p.

Suppose a student is scanning a catalogue for a course to take and sees the course title “Recursive Function Theory” versus “Computability Theory. apply for jobs under the general area of his work as the ﬁrst or second? Should a professor write an abstract for his lecture at another university under the ﬁrst title or second? Names do matter.D.” to run back.” Which will give him more information about the content of the course? Should a fresh Ph. Name Recognition. 49 .everyone was to formally capture the informal concept of “eﬀectively calculable” which Turing machines did to G¨del’s satisfaction. In 1935 Church adopted G¨del’s recursive o functions as a deﬁnition of eﬀectively calculable before seeing Turing machines As Kleene relates. The object was never to understand the notion of recursions or inductive deﬁnitions. the former being a bit more general. The word has nothing to do with “calculate” or “compute. a ﬁrst year programming course speaks of deﬁnition by iteration versus deﬁnition by recursion. For example. The word “recursive” means a procedure characterized by recurrence or repetition from the Latin verb “recurrere. They mattered to Church and Kleene in 1936 when they changed from the term “λ-deﬁnable function” to “recursive function” to achieve greater name recognition among mathematicians and to make Church’s Thesis more convincing before the appearance of Turing.” The general public understands the ﬁrst two words in this context. not in an attempt to better understand the nature of recursion and inductive deﬁnition. a world partially created by Turing. To the extent that they have any idea about “recursive” they understand it in this context. Scientiﬁc Accuracy. while o at ﬁrst G¨del’s own model of Herbrand-G¨del recursive functions did o o not. The words “calculate” and “compute” are very close in the dictionary. Names matter today as we try to relate our specialty of computability to the world of computers and algorithmic procedures all around us. Church and Kleene did this as a matter of public relations to relate to a concept mathematicians could understand.

Kleene was aware of other similar “theses” advanced nearly simultaneously and he continued [1952. p. “This heuristic evidence and other considerations led Church 1936 to propose the following thesis.” Kleene [1952.” This is identical with what we previously called Church’s Thesis 2. Of course. 60] referred to Church’s “deﬁnition” as “Thesis I.” These were not even called “theses” at all until Kleene [1943.300]. “This thesis is also implicit in the conception of a computing machine formulated by Turing 1936–7 and Post 1936. p.12 12.” 12. p. 300] took up where Kleene [1943] had left oﬀ. not putting forth a “thesis. Kleene wrote. Thesis I. Every eﬀectively calculable function (eﬀectively decidable predicate) is general recursive.1 Renaming it the “Computability Thesis?” Kleene Called it “Thesis I” in [1943] In the 1930’s both Church and Turing thought they were giving deﬁnitions of an eﬀectively calculable function.” Apparently he did not feel it necessary to include Turing’s name when he used the term “Church’s thesis. Church’s thesis. “ §62. One of the main objectives of this and the next chapter is to present the evidence for Church’s thesis (Thesis I) §60.317] began a new section §62 and called it “Church’s thesis” instead of “Thesis I” as he had been doing.” 50 .” Next Kleene begins a subtle shift of terminology from “Thesis I” to “Church’s thesis.” Kleene wrote [1952.2 Kleene Named it “Church’s thesis” in [1952] Later in his very inﬂuential book [1952] it is fascinating to see how Kleene’s thinking and terminology progressed from “Thesis I” to “Church’s Thesis” and not to “Turing’s Thesis” or the “Church-Turing Thesis. p.2.

e.4 Evidence for the Computability Thesis In one of the most familiar parts of the book. “(C) Turing’s Concept of a Computing Machine. according to his analysis. . and systems of Post [1943] and [1946] of canonical and normal systems. Turing’s formulation hence constitutes an independent statement of Church’s thesis.. These arguments have been cited in hundreds of computability books and papers for the last half century. After some heuristic evidence in (A). Turing computable functions. Kleene presented perhaps the most powerful evidence. ” “While we cannot prove Church’s thesis. . §60). §62. “ Church’s thesis. since its role is to delimit precisely an hitherto vaguely conceived totality. we take to be already conﬁrmed by the intuitive notion (cf. by supplying a precise delimitation of all effectively calculable functions. . p. ” “The converse of Church’s thesis. to reproduce all sorts of operations which a human computer could perform.” 51 . §62. working according to preassigned instructions. 319]. Kleene summarized the evidence for “Church’s thesis” in [1952. 318–319] he dropped any reference to “Thesis I” and used only “Church’s thesis” with no mention of Turing or Post in the thesis. Ironically. while other notions arose diﬀerently and were afterwards identiﬁed with eﬀective calculability. Turing’s notion is thus the result of a direct attempt to formulate mathematically the notion of eﬀective calculability. that every general recursive function ϕ is eﬀectively calculable.3 Kleene Dropped “Thesis I” for “Church’s thesis” As Kleene progressed through [1952. i. He wrote [1952.12. 318–319]. . . . λ-deﬁnable funco tions. we require evidence that it cannot conﬂict with the intuitive notion which it is supposed to complete. p. to clinch the evidence for Church’s thesis Kleene began a new part (C) where he appealed to Turing’s work and wrote. pp.” 12.” Turing’s computable functions [1936–7] are those which can be computed by a machine of a kind which is designed. the “(B) Equivalence of diverse formulations:” such as the (Herbrand-G¨del) general recursive functions.

The Formalism. As an intensional claim it had nothing to do with the recursive functions of Church’s Thesis 2. A formal mathematical deﬁnition for eﬀectively calculable functions.2. Kleene here was using the term “Church’s thesis” to include Turing’s Thesis and Turing’s justiﬁcation. Turing’s work was to establish the connection between eﬀectively calculable functions and Turing computable functions in Turing’s Thesis 3. Church [1936] proposed G¨del’s general recursive funco tions [1934]. A function on the positive integers is eﬀectively calculable if and only if it is recursive or Turing computable. [The Computability Thesis Emerges].” Kleene omits Turing’s name from the thesis even though in part (C) above he gave Turing credit as the only one who made a “direct attempt to formulate mathematically the notion of eﬀective calculability.1. Many people today use “Church’s Thesis” in this way. Remark 12.1. or deﬁned by any of the other formalisms. 52 . [The Computability Thesis]. 2007] with no mention of Turing.” Deﬁnition 12.2. Turing invented the new formalism of Turing machines because this was closest to his idea of a mechanical process and because it lent itself to proving that any eﬀectively calculable function lay in this class. From now on when Kleene uses the term “Church’s thesis” he means the following “Computability Thesis. Kleene knows that the various formal deﬁnitions all coincide extensionally. Note that the Computability Thesis is essentially the same as what we have called the Church-Turing Thesis 3. and he regards them interchangeably. The Computability Thesis.We see here the amalgamation of diﬀerent meanings into a single term (just as for “recursive” above).5 Who First Demonstrated the Computability Thesis? Demonstrating something like the Computability Thesis requires two steps.2. 12. used extensively in the subject. It was only the equivalence of Turing computable functions ﬁrst with λ-deﬁnable functions and hence with recursive functions which links them extensionally but not intensionally. It is exactly here that Kleene introduces (without explicit mention) another convention and term which has lasted until today. It does not refer to one single man or to one single formalism. is usually listed under the name “Church’s Thesis” as in the title of the new book [Olszewski. regardless of their intensional or historical import.

. Gandy [1988. No modern book uses the H-G general recursive formalism to deﬁne the eﬀectively calculable functions.The Demonstration. ﬁrst by an application of an algorithm. 3 Gandy actually wrote “Church’s thesis” not “Turing’s thesis” as written here.” Turing’s Thesis [1936. 83–84] pointed out. i. . In contrast. c0 . 77]) from two points of view. but surely Gandy meant Turing’s Thesis. at least intensionally. G¨del had shown that the o steps in his formal system P were primitive recursive. We say that the calculation is stepwise n 0 1 recursive if there is a partial recursive function ψ such that ψ( c0 . this second step is so crucial that it has been referred to as a “theorem” by Gandy and others. cn = pc0 · pc1 . 120–121] it is reasonable to suppose that the calculation of f proceeds by writing expressions on a sheet of paper. . A considerably more serious objection is that there was a ﬂaw in Church’s demonstration that every eﬀectively calculable function is general recursive.” Church analyzed the informal notion of the calculation of a value f (n) = m according to a step-by-step approach (so called by Gandy [1988. and that the expressions have been given code numbers. c1 . §9] stated in Deﬁnition 3. . ci ) = ci+1 for all i. Church began by deﬁning an “eﬀectively calculable” function to be one for which “there exists an algorithm for the calculation of its values.e. pp. pcn . .”3 Furthermore. The second and perhaps more important step is to prove that the informal notion of a person calculating a function can be simulated by the formal model. . was not convinced as o we have seen in §2 and §3. 0 ≤ i < n. Following Davis [1958. We refer to this step as a “demonstration” rather than a formal “proof. pp.1 is that every intuitively computable (eﬀectively calculable) function is computable by a Turing machine. p. as Gandy [1988. and second as the derivation in some formal system. . Church used the Herbrand-G¨del general recursive functions o as his formal model but even their inventor. . a codiﬁcation. because Turing did not prove anything in [1936] or anywhere else about general recursive functions. . Turing machines appear as a result. . §7] for his thesis was this. Deﬁne c0 . “Turing’s analysis does much more than provide an argument for ‘Turing’s Thesis. . 53 . of his analysis of calculations by humans. p. This step is not a purely mathematical one but it needs to be as convincing and logical as possible. 64] or Shoenﬁeld [1967..” Although it is not a formal proof. The ﬂaw in Church’s argument [1936. . G¨del.’ it proves a theorem. c1 . cn . “Turing’s analysis makes no reference whatsoever to calculating machines. because as he pointed out. p. the computability thesis. 82] observed.

It is exactly this stumbling block which Turing overcame by a totally new approach. whose name should it be? Isaac Newton began working on a form of the calculus in 1666 but did not publish it until much later. “Despite this ruling of the Royal Society. 12. If we had to attach a single name to “the calculus” every time we mentioned it. this core does not provide a convincing analysis: steps taken in a calculus must be of a restricted character and they are assumed. something he did not justify. in their excellent analyses. The Wiki encylopedia wrote. p. . 80. for example by Church. and that stumbling block was quite clearly seen by Church. 1935 (see Kleene [1987b. pp. “. 78] wrote. 87]. Newton did not publish it until 1687 although most believe he had been working on it before Leibniz began in 1674.If the basic steps are stepwise recursive. that the entire o process is µ-recursive.6 The Computability Thesis and the Calculus Why all the fuss over names? Why not simply use the term “Church’s Thesis” invented by Kleene [1952]. and let it refer to the “Computability Thesis?” This is in fact what is widely (and incorrectly) done. Newton was more established than Leibniz and had vigorous supporters. Sieg [p.” 54 . mathematics throughout the eighteenth century was typiﬁed by an elaboration of the diﬀerential and integral calculus in which mathematicians generally discarded Newton’s ﬂuxional calculus in favor of the new methods presented by Leibniz. The fatal weakness in Church’s argument was the core assumption that the atomic steps were stepwise recursive.” Sieg [p. There was a great controversy about priority up until Leibniz’s death in 1716. then it follows easily by the Kleene Normal Form Theorem which Kleene had proved and communicated to G¨del before November. The British Royal Society handed down a verdict in 1715 crediting Isaac Newton with the discovery of the calculus. and stating that Leibniz was guilty of plagarism (although these charges were later proved false). without argument to be recursive. 57]). “It is precisely here that we encounter the major stumbling block for Church’s analysis. brought out this weakness in Church’s argument. Gottfried Leibniz began work on the calculus in 1674 and published his account of the diﬀerential calculus in 1684 and the integral calculus in 1686. Gandy [1988. 80] wrote. . Newton and his followers campaigned vigorously for his position. 79] and especially Sieg [1994. p.” who wrote that without this assumption it is diﬃcult to see how the notion of a system of logic can be given any exact meaning at all.

The Kleene o µ-recursive functions have other uses but are were not mentioned in the original Church’s Thesis 2. Church and Turing both worked independently on it and came up with diﬀerent models. the Turing machines (and other calculating machines like register machines) dominate. Church was the senior ﬁgure in computability (after G¨del). The general recursive functions are never seen.D. Church’s o claim to the Computability Thesis was aﬃrmed by his former Ph. 1. Kleene occasionally mentioned Turing’s Thesis and repeatedly used the Turing machine model and Turing’s demonstration of its success to demonstrate the Computability Thesis. Turing’s model of Turing machines is overwhelmingly more appealing and popular that Church’s model of the (Herbrand-G¨del) general o recursive functions. 3.” 5.2. “mathematicians generally discarded Newton’s ﬂuxional calculus in favor of the new methods presented by Liebniz. Leibnitz began later than Newton. Kleene deliberately and overwhelmingly established 55 . In computer science. 6. unaware of the work by another researcher.7 Founders of Computability and the Calculus There is a parallel between the development of the Calculus and the demonstration of the Computability Thesis. student Stephen Kleene [1952]. 2. respectively. The general recursive functions are used only in an historical discussion. However.) 4. a model which is rarely presented in any books and never used for actual calculations in any courses. Kleene’s µ-recursive functions are sometimes used in courses and mistakenly called recursive functions but to prove that an eﬀectively calculable function is µ-recursive requires a tedious arithmetization as in G¨del’s incompleteness theorem [1931] and is o virtually never done. despite the Royal Society ruling. Newton was in the position of power with the Royal Society which not only aﬃrmed his claim but denied the claim by his rival Leibniz. Turing began slightly later than Church.12. For the calculus. Both Leibniz and Turing worked at a distance and independently of Newton and Church. (This refers to the Herbrand-G¨del general recursive functions.

Virtually all the papers and books including Rogers [1967] and Soare [1987] and many others followed Kleene’s lead. Turing. The problem is simply that Kleene has not given Turing credit in his naming of the Computability Thesis. inductive and computable. the participants.” We never refer to “the Newton calculus” or the “Leibniz calculus.the phrase “Church’s thesis” to stand for the “Computability Thesis.3. Kleene thought and wrote with tokens. Today we refer to “the calculus” without any founder’s name. Unlike the calculus. but Kleene was certainly successful in excluding Turing’s name from the Computability Thesis. Church. It is ambiguous to use “recursive” with both meanings. words that are given arbitrary and nonstandard meaning by the author: “recursive” means “computable. “the Computability Thesis” and not “Church’s Thesis.” or the “Church-Turing Thesis?” Which of the three terms is more understandable to an outsider who has never heard about the subject? 56 . as we have seen. Why not call it simply. it is simply wrong to use “Church’s Thesis” to refer to a proposition ﬁrst demonstrated by Turing and never successfully demonstrated by Church. The Royal Society was not successful in excluding Leibniz from the calculus. ” at a time when nobody called it a thesis and when the ﬁeld was about to rapidly expand in the 1950’s and 1960’s and would turn to Kleene for direction as the last representative of the original computability researchers of the 1930’s and the most prominent and inﬂuential of all computability theorists in the 1950’s. have given credit to the others. Kleene could have called it “the Computability Thesis” analogously with “the calculus. Second. Kleene just does not include Turing in the name he chose.” “Church’s Thesis” means the “Computability Thesis.” Why do we need to give a person’s name to the Computability Thesis? Kleene never denied credit to Turing and in many places such as his books [1952] and [1967] he gives Turing credit for the most intuitive presentation of computability.” The arbitrary and sometimes misleading use of words has diminished our communications among ourselves and with other scientiﬁc and scholarly colleagues. Remark 12. It would also be wrong to refer to “the Newton Calculus” without mentioning Leibniz. and their followers.

analysis and other ﬁelds are incomputable not computable and relative computability uniﬁes them. 13.” and on [1952. we should not call the subject “incomputability theory” because the underlying theme is the notion of relative computability as absolute because of the Oracle Graph Theorem 4. 2. and one other (D) which may be included under (A).” 13. Kleene [1952. He recommended this thesis but did not give a separate justiﬁcation. The objects considered in degrees of unsolvability. Kleene deﬁned Thesis I* to be the corresponding relative computability thesis which we have called Post-Turing Thesis 6. p. 314] wrote. p. 314] took up the theme of relative computabilty of a function from an oracle set. §4] brieﬂy introduced an oracle machine (o-machine) and how and in §5–§7 how Post developed relative computability through the inﬂuential Kleene-Post [1954] paper. 57 . Post.2 Relative Computability Uniﬁes Incomputability The ﬁeld of computability theory deals mostly with incomputable not computable objects. p. geometry.5. A Turing a-machine can easily be simulated by a Turing o-machine and the latter is scarcely more complicated to explain. model theory. Most of the objects considered in computability theory and applications to algebra.13 13.1 Turing a-machines versus o-machines? Turing. “The evidence for Thesis I will also apply to Thesis I*. However. in diﬀerential geometry as in Csima-Soare [2006] or Soare [2004] all deal with incomputable objects.1. “We now summarize the evidence for Church’s Thesis (and Thesis I*.3 The Key Concept of the Subject The notion of an oracle machine and relative computability is the single most important in the subject. and because it relates and uniﬁes the myriad incomputable objects. Kleene [1952. in computable model theory. Analogous to his version of Thesis I considered above. 1. end §61) under three main headings (A)–(C). and Kleene on Relative Computability In §4 we have seen how Turing [1939. 319] he wrote.

Cooper’s new book [2004] introduces oracle Turing machines on page 139.3. p. 13. Kleene’s second and more introductory book. 267] has a brief discussion of reducing one predicate to another and on degrees of unsolvability.4 When to Introduce Relative Computability In view of the importance of relative computability. and online computing in both theoretical results and real world computing it is surprising how many computability books introduce oracle machines and Turing functionals so late in the book or not at all. Lerman [1983] deﬁnes relative computability from an oracle by adding the characteristic function of the oracle to the Kleene µ-recursive functions. In another popular introduction. I [1989] and Vol. For example. Classical Recursion Theory Vol. A relative computability process ΦA corresponds to a continuous funce tional on Cantor space analogous to continuous functions in analysis. Many if not most computing processes in the real world are online or interactive processes. better modelled by an o-machine than an a-machine. A function on Cantor space given by an a-machine is merely a constant function. o Rogers [1967] took the Turing machine approach and immediately deﬁned computability using regular Turing machines (a-machines). Cutland [1980] introduces relative computability relatively late on page 167. Rogers quickly became the most readable textbook on computability and remains a popular reference. Kleene’s book [1952] was the ﬁrst real book on computability theory and the principal reference for at least ﬁfteen years until Rogers [1967] appeared. 4. This occurs on page 11 but Lerman is assuming that the reader has already mastered a ﬁrst course in computability using a text such as Rogers [1967]. II [1999] introduce relative computability only on page 175 by adding the characteristic function of oracle set A to the Kleene µ-recursive functions. Mathematical Logic [1967. The more recent and very extensive books by Odifreddi. Boolos and Jeﬀrey in Computability and Logic [1974] do not discuss it at all. Computability. The only genuine introduction to computability I 58 . Rogers introduced relative computability only in Chapter 9 on page 128 using Turing’s original deﬁnition [1939] of an ordinary Turing machine with the additional capacity to consult an oracle A occasionally during the computation. Kleene introduced relative computability in Chapter 11 on page 266 by adding the characteristic function of the oracle set A to the Herbrand-G¨del general recursive functions.

including Church and Kleene. which deﬁnes it on page 20 of Chapter 1 using oracle Turing machines.” “Turing’s Thesis. We should use the term “recursive” to mean “deﬁned inductively” not “calculable” or “computable. This emphasis on computability (rather than recursion) and its relation to incomputability has been developed in many recent books and papers such as Cooper [2004]. This change has largely o been accomplished since the papers on computability and recursion in Soare [1996] and Soare [1999]. I believe that one should introduce o-machines and relative computability as soon as possible. I thought of moving o-machines to Chapter I and doing it all at once. while Turing invented a new model.2.” or the “Church-Turing Thesis. 59 . See these papers and the discussion in §11.” Church and Kleene [1936] introduced the term “recursive” to mean “computable” primarily for public relations reasons as Kleene [1981] explained (see §2. the Turing a-machine which everyone. 14 Conclusions Conclusion 14.1. Nevertheless. Over the next few decades Kleene reinforced and promulgated this convention. Conclusion 14. but my students persuaded me that people need time to absorb the concepts. In the former book Soare [1987] and new book [CTA] Turing a-machines come in Chapter I and Turing o-machines at the beginning of Chapter III after which the book is based on Turing reducibility.” particularly since Turing and G¨del had both rejected this usage. agreed was the most convincing of the thesis.found which introduces relative computability immediately is Martin Davis Computability and Unsolvability [1958]. but by the 1990’s it had become much more useful for communication and more accurate scientiﬁcally and historically to remove the meaning of “computable” from the term “recursive.” The subject is called “Computability Theory” not “Recursive Function Theory” or “Recursion Theory. but Turing o did demonstrate his thesis in a manner convincing to essentially everyone. Church gave a formal model (the Herbrand-G¨del general recursive funco tions) which was not convincing even to its author.” It is misleading to refer to it as “Church’s Thesis” as many people do because Church never demonstrated the thesis (at least to the satisfaction of G¨del and modern scholars like Gandy [1988] and Sieg [1994]).3). It is most accurate and informative to refer to the central thesis of the subject as the “Computability Thesis” not “Church’s Thesis.

332-333. For pedagogical reasons with beginning students it is reasonable to ﬁrst present Turing a-machines and ordinary computability. 1935] A. Computability and Logic. volume 9. Soc. 1936] A. attached.. and has been since the 1930’s. Symbolic Logic. Amer. Cambridge. [4] [Church. See §13 and §4–§7. and P. Review of Turing 1936. Why not replace the name in computability by a descriptive and informative term like “Computability Thesis?” See the discussion in §12. Math. 60 .. Fejer.3. Church. 40–41. Ambos-Spies. Preliminary Report (abstract). [3] [Church. The single most important concept is that of relative computability to relate incomputable objects. Cambridge Univ. of Math.Neither of Turing nor G¨del thought of this as a thesis. Bull. 42–43. American J. Engl. 1 (1936). The subject is primarily about incomputable objects not computable ones. Parallels should be drawn with oﬄine and online computing in the real world. See §13. ta] K. Degrees of unsolvability Handbook of Logic. Church. Boolos and R. However. [5] [Church. 58 (1936). 1974] G. Newton or Leibniz. The term o “Church’s thesis” was started arbitrarily by Kleene alone in [1952]. 1936b] A. 41 (1935). to appear. Correction 101–102. Church. We use the term “the calculus” without the name of either founder. [6] [Church.4. Symbolic Logic 2(1) (1937). A note on the Entscheidungsproblem. Press. Church. 1974. 1937] A. 345-363. An unsolvable problem of elementary number theory. J. J. An unsolvable problem of elementary number theory.4. Jeﬀrey. References [1] [Ambos-Spies and Fejer. any introductory computability book should then present as soon as possible Turing oracle machines (o-machines) and relative computability. Conclusion 14. [2] [Boolos and Jeﬀrey. Conclusion 14.

2007. Cooper and P. F. to appear. Fund. Lecture Notes in Computer Science. B. 2004] S. Sorbi.S. Kluwer Academic/Plenum. [15] [Copeland-Posy-Shagrir. Perspectives East and West. Church. Cooper. Church and S. Symbolic Logic 2(1) (1937).B. 44 (1938). Formal deﬁnitions in the theory of ordinal numbers. A. Heio delberg. The incomparable Alan Turing. Sorbi. published electronically. Computability: G¨del. Berlin. 2004b] S. S. Cooper. Csima and R. (eds. L¨we. 1937b] A.M. Andrea Sorbi (Eds. Lecture at Manchester University. 5 June. and Oron Shagrir. In: S. Incomputability in nature. o New computational paradigms: changing conceptions of what is computable. 2008. (eds. [13] [Cooper-Lowe-Sorbi. Review of Post 1936.). Cooper and S. L¨we. Siena. 2008] S.S.[7] [Church. No. Church. [9] [Church and Kleene.B. Goncharov (Eds. June 18–23.). Cooper. 224–232. Turing. Symbolic Logic. New computational paradigms: changing o conceptions of what is computable. Kleene.) Computability and Models. B. Carl Posy.). CiE 2007.bcs. Odifreddi. Computablility Theory. Soare. 2007] S. C. o Computation and Logic in the Real World. J. 4497.B. 1938] A. Cooper. Chapman & Hall/CRC Mathematics. 71 (2006).B. 43. ta] Jack Copeland. [8] [Church.B. B. 28 (1936) 11–21. Dordrecht. Proceedings of the Third Conference on Computability in Europe. A. J. MIT o Press. L¨we. and Beyond. 1394–1410. Sorbi. pp. (2003) 137–160.B. Math. 2006] B. B. 2004. http://www.). 1936] A.B. [16] [Csima-Soare. The constructive second number class. vol. 2003] S.org/server. Bull. (Springer-Verlag. A. 61 .php?show=ConWebDoc. L¨we. [10] [Cooper.17130 [12] [Cooper-Lowe-Sorbi.I. 2007. 2004. A. 2008. [14] [Cooper-Odifreddi. [11] [Cooper. Italy. London. Springer-Verlag. Springer-Verlag. (eds. Church. Computability Results Used in Diﬀerential Geometry. Cooper. New York.

reprinted 1983. 3–24. 1958] M. 1958.W.”) [23] [Davis. 2000.. In: The Kleene Symposium. Z. 5 (1959). 236–238. 1997. Davis. Church’s thesis and principles for mechanisms. Engl. The Undecidable. Heidelberg. Cambridge Univ. [20] [Davis. and Computable Functions. Math. Computability: An introduction to recursive function theory. [22] [Davis. 1989] Epstein and Carnielli. W. New York. 1988. M. Sci. 1997] J. o [25] [Epstein and Carnielli.K. Norton & Co. The myth of hypercomputation. Computable Functions. 123–148. [24] [Dawson. Press. In: Teutscher. [26] [Friedberg. Jr. Berlin. (Ed). Unsolvable Problems. 1959] R. Cambridge. and the Foundations of Mathematics. 1965] M. Springer-Verlag. 1989. [28] [Gandy. In: Herken. New York. Davis. [27] [Friedberg-Rogers. Gandy. Logical dilemmas: The life and work of Kurt G¨del. Mc-GrawHill. (ed. Davis. Why G¨del did not have Church’s Thesis. reprinted in 1982 by Dover Publications. Computability and Unsolvability. New York. 1957] R. Second Printing Wadsworth Thomson Learning. o Information and Control 54 (1982). Friedberg. Logik Grundlag. (The same book was also published by Norton in 2000 under the title “Engine of Logic.. Proc. W. C. 1980. 1980] R. Rogers. Alan Turing: Life and Legacy of a Great Thinker. Acad. 2000. Friedberg and H. USA 43 (1957). Two recursively enumerable sets of incomparable degrees of unsolvability. Basic Papers on Undecidable Propositions. New York. Mathematical logic and the origin of modern computers. 2004] M. Cambridge. 1982] M. The universal computer: The road from Leibniz to Turing. Logic. A. London. 62 . Peters Press. (2004) 195–211. [19] [Davis. Natl. 1988] M. M. North-Holland. Computability. Davis. Hewlett. Davis. Math. Reducibility and completeness for sets of integers. (1980). Dawson. 2000] M. Raven Press. 117–125. 1980] Nigel Cutland.[17] [Cutland. Davis.). [18] [Davis. [21] [Davis. 149–174. 1965.

Math. 1946] K. Feferman et. al. 38 (1931) 173-178. Phys. C. [40] [Goldin-Smolka-Wegner] D. p. 39–74]. In: G¨del [1990. editors. 1946. o [37] [G¨del. 4–38]. (English trans. [34] [G¨del. 30 pp. 71–73]. o o (written in 1972). Springer-Verlag. 1986. 1934.) [31] [G¨del. Oxford Univ. editors. Interactive Computation: The new Paradigm. Gandy. 304–323]. Press. S. 1990. S. ¨ [30] [G¨del. Collected works Volume II: Publications 1938– o o 1974. 1934] K. 1995] K. 193?] K.) [35] [G¨del. Rosser on lectures at the Institute for Advanced Study. [36] [G¨del. 156–175]. S. Press. [38] [G¨del. Kleene and J. 1988] R. 55–111. On undecidable propositions of formal matho o ematical systems.. G¨del. G¨del. G¨del. o o o printed in Davis [1965. P. and in van Heijenoort. (Reprinted in Davis [1965. 1986] K. al... p. I. 1931] K. Press. al. In: o o G¨del [1995. Some basic theorems on the foundations of o o mathematics and their implications. Oxford. 592–616. written in 1946. Uber formal unentscheidbare s¨tze der Prino o a cipia Mathematica und verwandter systeme.[29] [Gandy. Feferman et. 84–88]. The conﬂuence of ideas in 1936. (This o was the Gibbs Lecture delivered by G¨del on December 26. G¨del. Oxford. G¨del. 305–306]. In: Herken. 1995. Soc. Goldin. Oxford. Monatsch. B. G¨del. Some remarks on the undecidability results. Notes by S. 63 . Collected works Volume III: Unpublished eso o says and lectures. New Jersey. G¨del. in Davis [1965. G¨del. Feferman et. S. Princeton. Math. Collected works Volume I: Publications 1929– o o 1936. 1990] K. Postscriptum to G¨del [1931]. Oxford Univ. [39] [G¨del. 1972] K. editors. 1967. Smolka. G¨del. Undecidable diophantine propositions.) [32] [G¨del. p. 2006. Oxford Univ. 1951 to the o Amer. Wegner. o [33] [G¨del. 1964] K. G¨del. In: G¨del [1995. Remarks before the Princeton bicentennial o o conference of problems in mathematics. Reprinted in: Davis [1965. 1951] K.

2 (1936). 727–742. Uber das Unendliche. 1905.M. [52] [Kleene. 7th ed. J. Leipzig. 64 . λ-deﬁnability and recursiveness. in van Heijenoort [1967.S. Hilbert. Springer. 1930. New York. 1934] D. 367– 392]. Tuebner-Verlag. Alan Turing: The Enigma. [47] [Hilbert and Bernays. Hilbert and W. Grundlagen der Geometrie. Bernays. Duke Math. C. Hilbert. 1983. 2004] A. 161–190. 1988. Ackermann.bcs. Oxford Univ..) [45] [Hilbert. Die Grundlagen der Mathematik. 5 June. Hilbert. Reprinted in van Heijenoort [1967. 1928 (English u translation of 1938 edition. 174–185. Kleene. 1927] D. 464–479]. 1936b] S. Uber die Grundlagen der Logik und der Arithmetik. A. ¨ [43] [Hilbert. C. Mathematische Annalen 95 (1926). Ann. 1899] D. Kleene. New York. 1936c] S.). II (1939). Grundlagen der Mathematik I (1934). Grundz¨ge der theoretischen Logik. 1950). Second ed. Abhandlungen aus dem mathematischen Seminar der Hamburgischen Universit¨t 6 (1928). C. I (1968). a [46] [Hilbert and Ackermann. and Simon and Schuster. Teubner. II (1970). pp. General recursive functions of natural numbers. 1928] D. London. 340–353. (English trans. August 1904. 1936] S. Chelsea.[41] [Herken. 1983] A. ¨ [44] [Hilbert. Reprinted in van Heijenoort [1967. http://www. [48] [Hodges. [51] [Kleene. 1904] D. Kleene. 42 (1936). Math. Lecture at Manchester University. Berlin. Hodges. A note on recursive functions. Berlin. Bull. Hilbert and P. Hodges. Berlin. 65–85. Herken (ed. 129–138]. 544–546. published electronically. [42] [Hilbert. bis 13. Burnett Books and Hutchinson. 2004. Hilbert. Press. [50] [Kleene. 112 (1936). Leipzig. 1988] R. Alan Turing: the logical and physical basis of computing. 1926] D.. [49] [Hodges. The Universal Turing Machine: A Half-Century Survey.org/ewics. In:Verhandlungen des Dritten Internationalen Mathematiker-Kongresses in Heidelberg vom 8. Springer.

Inc. 1955b] S. C. J. [58] [Kleene. C. Van Nostrand. 77 (1955). C. J. 1981] S. 3. of the London Math.M. Symbolic Logic. 1–52. Arithmetical predicates and function quantiﬁers. Groning¨n and North-Holland. [56] [Kleene. C. C. 1962b] S. Bull. Trans. 405–428. 1963] S. Kleene. Kleene. New York. [65] [Kleene. C. 91 (1959). C. Kleene. On the forms of the predicates in the theory of constructive ordinals (second paper). 1959] S. 1943] S. 66 (1944). C. On the forms of the predicates in the theory of constructive ordinals. no. 12 (1962). Kleene. 312–340. 245–258. 1952] S. 1938] S. 52–67.S. A. C. Amsterdam. Soc. A.M. Annals of the History of Computing. Kleene. Trans. Introduction to Metamathematics. Math. 150–155. Math. Logic. 1955c] S. [61] [Kleene.. 79 (1955).M. methodology. Kleene. A. 1962. Amer J. [59] [Kleene.S. [62] [Kleene. Stanford University Press. Ninth reprint 1988. Recursive functionals and quantiﬁers of ﬁnite type II. [55] [Kleene. 108 (1963). Trans. Mathematical Logic. 3 (1981). 41–73. C. Walters-Noordhoﬀ Publishing Co. Recursive predicates and quantiﬁers. 106–142. Turing-machine computable functionals of ﬁnite types I. 1967] S. 193–213.. [64] [Kleene. On notation for ordinal numbers. A. Kleene. [63] [Kleene. Kleene. John Wiley and Sons.M. 41–58. Proc. Amer. e [57] [Kleene. Origins of recursive function theory. 38–45. [60] [Kleene. 53 (1943). Kleene.S. C. Recursive functionals and quantiﬁers of ﬁnite type I.[53] [Kleene. 1955] S. London.M. C. and philosophy of science: Proceedings of the 1960 international congress. Kleene.S. 65 . 1962] S. 61 (1955). Turing-machine computable functionals of ﬁnite types II. Kleene. New York (1952). 1944] S. [54] [Kleene. Hierarchies of number-theoretical predicates. Sydney. Kleene. 1967. Trans. A. C.S. Kleene. 3 (1938).

Mathematische Annalen 110 (1934). Khorezm Region. New York. C. 28 (1987). Heidelberg New York Tokyo. approaching its centennial. Classical Recursion Theory. 1987. C. 1981. In: Herken 1988. and major applications of it. 490–498. 194–197. Volume I 1989. [70] [Kleene.).) (ISBN13: 978-3938793091. Kleene. Sympos. Akad´maiai Kiad´ e e o (Akademische Verlag). 206 pp. Schmetterer (eds. 1983] M. of Math. Notre Dame Journal of Formal Logic. Degrees of Unsolvability: Local and Global Theory. 66 . 1987] S. Kleene. L.s. 1934] R. 1983. 1988] S. 1954] S. Heidelberg and New York. 17–54.). Muchnik. P´ter. 1989] P. 49–64.) ¨ [76] [Peter. [73] [Muchnik. Ann. 59 (1954). In: P. Naples. Weingartner and L.) 5. A. Ontos Verlag. [67] [Kleene. G¨del’s impression on students of logic o in the 1930’s. Reﬂections on Church’s Thesis. Uber den Zussammenhang der verschiedenen e Begriﬀe der rekursiven Funktion. Church’s Thesis After 70 years. 379–407. Uzbek. Bull. (Russian). Kleene. Wolenski (Eds. 300 pp. (1981). [75] [Olszewski.S. Lerman. Springer-Verlag.[66] [Kleene. 1987b] S. Turing’s analysis of computability. Proc. Bibliopolis. A. Academic Press. The theory of recursive functions. [69] [Kleene. On the unsolvability of the problem of reducibility in the theory of algorithms. [71] [Kleene-Post. Olszewski and J. 1979). 43–61. 1981c] S. G¨del o Remembered. Algorithms in various contexts. (551 pages. 1951] R. [68] [Kleene. C. 2007. Doklady Akademii Nauk SSR 108 (1956). 1967. Amsterdam. Rekursive Funktionen. C. [72] [Lerman. Volume II 1999. [77] [Peter. Kleene. SSSR. Kleene. C. Springer-Verlag. The upper semilattice of degrees of recursive unsolvability. Algorithms in Modern Mathematics and Computer Science (dedicated to Al-Khowarizimi) (Urgench. [74] [Odifreddi. NorthHolland. Recursive Functions. Third revised edition. Kleene and E. 2007] A. 1956] A. Budapest. P´ter. (n.M. Berlin. hardbound. 612–632. Odifreddi. Post. C. 1951. 1981b] S.

J. 50 (1944). 1941] E. Finite combinatory processes–formulation. Heidelberg New York. (Reprinted in Davis [1965. 1971. Absolutely unsolvable problems and relatively undecidable propositions: Account of an anticipation. Sacks. New York. 1967] J. [83] [Post. 1948] E. Amer. 1995] J. L. J. Math. 1971] J. 1–11. 284–316. J.) [82] [Post. (1967). 54 (1948). Heidelberg New York. J. 1991] J. L. 340–433]. 1991. [79] [Post. 197–215. 1967. Reprinted in Davis [1965. [80] [Post. Mathematical Logic. Putnam. Springer-Verlag.L 1 (1995). Recursive unsolvability of a problem of Thue. Reading. L. Symbolic Logic 12 (1947). [89] [Shoenﬁeld. Degrees of recursive unsolvability: preliminary report (abstract). Soc. 1936] E. Symbolic Logic 11 (1946). 1956] H. (Submitted for publication in 1941. 1946] E. London. [91] [Shoenﬁeld. Recursively enumerable sets of positive integers and their decision problems. Bull. Recursion Theory. [87] [Sacks. L. Note on a conjecture of Skolem. New York. Bull. The mathematical work of S. Post. Degrees of Unsolvability.) [84] [Post. Formal reductions of the general combinatorial decision problem. L. Post. Symbolic Logic 30. 1967] H. 304–337]. L. McGraw-Hill. NorthHolland. [86] [Rogers. [81] [Post. Lecture Notes in Logic. 8–43. Shoenﬁeld. C. 292–303].[78] [Post. [88] [Shoenﬁeld. Post. Trial and error predicates and the solution to a problem of Mostowski. (Reprinted in Davis [1965. J. Soc. 73–74. 1947] E. Math. Shoenﬁeld. Jr. 65 (1943). A.) Printed in Davis [1965. Amer. Springer-Verlag. 1990. Post. [85] [Putnam. Math. 67 . 641–642. Theory of Recursive Functions and Eﬀective Computability. 344 pp. E. Amer. 1990] G. Mass. Rogers. Kleene. 49–57. Post.. R.S. [90] [Shoenﬁeld. R. 1944] E. Amsterdam. AddisonWesley. 288–291]. 1943] E. Shoenﬁeld. R. Symbolic Logic 1 (1936) 103–105. R. L. Post. Shoenﬁeld. Post. Bull. Higher Recursion Theory.

1987. Soare. Symb. [101] [Teuscher. Cholak. 2004.B. pps.).). Providence. The history and concept of computability. Mathematics and Mind. I. 457–486. American Mathematical Society. Extensions. and Deﬁnability. 1994] W. 2007. Alan Turing: Life and legacy of a great thinker. 1999] R. 2000. L¨we. 3–36. Automorphisms. Soare. Computability and Incomputability. Amsterdam.). Andrea Sorbi (Eds. 1996] R. Springer-Verlag. M. to appear. Teuscher (ed. In: A. Soare. ed. 68 . 2004] C. 1987] R.[92] [Sieg. [97] [Soare. (Springer-Verlag. Vol. 284–321. in: P. Soare. Soare. Springer-Verlag. 279– 307. Siena. Heidelberg. Lecture Notes in Computer Science. 2007. I. and Oron Shagrir (eds. (eds. 2007] R. Oxford Univ. Griﬀor. 10 (2004). Computability theory and diﬀerential geometry. American Mathematical Society. S. Soare. MIT Press. [93] [Soare. Italy. I. I. Sieg. Press. E. Computability and recursion. Computation and Logic in the Real World. and Beo yond. 1994. and R. Turing. Lerman. Contemporary Math. Heidelberg. [98] [Soare. Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Bulletin of Symbolic Logic 2 (1996). in: Proceedings of the Third Conference on Computability in Europe. I. Mechanical procedures and mathematical experience. Bull. Computability Theory and Applications.). Church. Logic. o [99] [Soare. RI. Computability: G¨del. [100] [Soare. I. Springer-Verlag. 4497.) Computability Theory and its Applications: Current Trends and Open Problems. Berlin. Cooper. 2000] R. #257. I. Soare. [95] [Soare. I. Lempp. CTA] R. in: Jack Copeland. North-Holland. 2004] R. Soare. [96] [Soare. S. In: Handbook of Computability Theory. Heidelberg. CiE 2007. Shore. June 18–23. [94] [Soare. B. ta] R. to appear. George (ed. 1999. Turing-Post Oracle Computability and Realigning Computability Theory. No. Carl Posy.

1974] H. [113] [Wang. Systems of logic based on ordinals. Turing. 1954] A. ser. (Written in September. J. M. 1937a] A correction. London. 1937b] A. 69 . MIT Press. In: F. J. M. 45 Part 3 (1939). 161–228. Lecture to the London Mathematical Society on 20 February 1947. M.. Turing. 1939] A. ibid. Turing. L. M. 7–23. 1986. Symbolic Logic. Computing machinery and intelligence. Science News 31 (1954). E. [109] [Turing. 1986] A. 3–23. Press. [Turing. 3rd series 1 (1993). [112] [Wang. 1949. 1947 and submitted to the National Physical Laboratory in 1948. M. Solvable and unsolvable problems. 1974. 52 (1950). Wang. 2 (1937). Doran. reprinted in Davis [1965.” Annals of the History of Computing 6 (1984). Reﬂections on Kurt G¨del. 1950] A. “An early program proof by Alan Turing. Proc. MA. Jones. M. London Math. 2 42 (Parts 3 and 4) (1936) 230–265. Camo bridge. 154–222]. M. Morris and C. [111] [Wang. 1949] A. Routledge & Kegan Paul.) [106] [Turing. [114] [Wang. Carpenter and R. B. Philosophia Mathematica. Wang. Turing. 491–505. M. Turing’s ACE Report of 1946 and Other Papers. Symbolic o Logic 46 (1981) 653–659. 43 (1937). Soc. On physicalism and algorithmism: can machines think?. [105] [Turing. In: Machine Intelligence 5. Intelligent machinery. [103] [Turing. Wang. Computability and λ-deﬁnability. Wang. 1950b] A. 1936] A. Turing.[102] [Turing. In: B. 139-143. 1993] H. M. Text of a lecture by Turing on June 24. 106–124. Mind 59 (1950) 433–460. [108] [Turing. 153–163. 1987] H. A. From Mathematics to Philosophy. W. Turing. Turing. Soc. [110] [Turing. Proc. 1981] H. M. 1948] A. [104] [Turing. 97–138. [107] [Turing. Cambridge Univ. Some facts about Kurt G¨del. London Math. eds. 544–546. Ann. of Math. The word problem in semi-groups with cancellation. Turing. Turing. On computable numbers. with an application to the Entscheidungsproblem.

Department of Mathematics University of Chicago Chicago.cs.uchicago.edu URL: http://www.people. Illinois 60637-1546 soare@uchicago.edu/∼soare/ 70 .

- Lambda Calculus
- The Lambda Calculus
- Complexity Lecture Notes
- problem NP
- Computability Theory
- MathematicalLogicandFunctionalProgra
- Foundations of Mathematics Lecture Notes
- Foundational Calculi for Programming Languages
- Simple Functions in Haskell
- Mathematical Relations
- 221707 Introduction to Functional Programming Lambda Calculus
- Large Cardinal
- Talk FunctionPointsv2.2.23.2004
- 53607708 Soft Computing
- supplemental.pdf
- A New Non-symmetric Information Divergence Of
- specfuncs
- 17-toc
- J 8709 PAPER III
- 09 Informed Search
- Chapter 2 Part 2 - Stud
- Kernel Methods in Machine Learning
- Cable 3.2 Lambda Notation
- Recursive Function Definition
- Function Point Counting - PF
- 80_Toffoli
- V2I30026
- Riemann's paper 2
- Project 3
- Lab 3 Report_dsp
- turing

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd