The

Church-Turing
Thesis

Church-Turing Thesis – revisited Criticism on and

interpretations
of the
Church-Turing
Thesis

Bas van Gijzel Variations on

the
Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis

June 7, 2010 Feasibility

Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

1
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

2
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

3
So first...

The
Church-Turing
Thesis

Criticism on and
interpretations
of the
Church-Turing
A reintroduction to the Church-Turing Thesis and some Thesis

Variations on
concepts from Sélinde’s talk. the
Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

4
Alonzo Church (1903-1995)

Church wanted to define the notion of an effectively The

Church-Turing
calculable function. Thesis

Criticism on and
interpretations
of the
Church-Turing
Thesis

Variations on
the
Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

5
An effectively calculable function: a small
motivation
The
Church-Turing
Thesis

Criticism on and
interpretations
I What is an effectively calculable function? of the
Church-Turing
• An informal concept. Thesis
• Explained as: “calculable by a finite (mechanical) Variations on
the
procedure”. Church-Turing
Thesis
I Some possible intuitive notions: Physical/Strong
Church-Turing Thesis

• Functions humans can solve in finite time. Feasibility

Thesis/Extended
Church-Turing Thesis
• Functions that can be constructively defined. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

6
An effectively calculable function: a small
motivation
The
Church-Turing
Thesis

Criticism on and
interpretations
I What is an effectively calculable function? of the
Church-Turing
• An informal concept. Thesis
• Explained as: “calculable by a finite (mechanical) Variations on
the
procedure”. Church-Turing
Thesis
I Some possible intuitive notions: Physical/Strong
Church-Turing Thesis

• Functions humans can solve in finite time. Feasibility

Thesis/Extended
Church-Turing Thesis
• Functions that can be constructively defined. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

6
The Church Thesis

I Church wanted to define this notion of effectively The

Church-Turing
calculable by using λ-definable functions. Thesis

Criticism on and
I After encountering Gödel this was deemed interpretations
of the
unsatisfactory and the ’thesis’ was changed. Church-Turing
Thesis
New solution: Variations on
the
I Identify effectively calculable functions with the Church-Turing
Thesis
recursive functions. Physical/Strong
Church-Turing Thesis
Feasibility
I One identification is done in the context of calculability Thesis/Extended
Church-Turing Thesis
Quantum
in a logic. Complexity-Theoretic
Church-Turing Thesis

I Problem: steps of the proof were not proved recursive Concluding

remarks
(or finite and mechanical).

7
The Church Thesis

I Church wanted to define this notion of effectively The

Church-Turing
calculable by using λ-definable functions. Thesis

Criticism on and
I After encountering Gödel this was deemed interpretations
of the
unsatisfactory and the ’thesis’ was changed. Church-Turing
Thesis
New solution: Variations on
the
I Identify effectively calculable functions with the Church-Turing
Thesis
recursive functions. Physical/Strong
Church-Turing Thesis
Feasibility
I One identification is done in the context of calculability Thesis/Extended
Church-Turing Thesis
Quantum
in a logic. Complexity-Theoretic
Church-Turing Thesis

I Problem: steps of the proof were not proved recursive Concluding

remarks
(or finite and mechanical).

7
The Church Thesis

I Church wanted to define this notion of effectively The

Church-Turing
calculable by using λ-definable functions. Thesis

Criticism on and
I After encountering Gödel this was deemed interpretations
of the
unsatisfactory and the ’thesis’ was changed. Church-Turing
Thesis
New solution: Variations on
the
I Identify effectively calculable functions with the Church-Turing
Thesis
recursive functions. Physical/Strong
Church-Turing Thesis
Feasibility
I One identification is done in the context of calculability Thesis/Extended
Church-Turing Thesis
Quantum
in a logic. Complexity-Theoretic
Church-Turing Thesis

I Problem: steps of the proof were not proved recursive Concluding

remarks
(or finite and mechanical).

7
The Church Thesis

I Church wanted to define this notion of effectively The

Church-Turing
calculable by using λ-definable functions. Thesis

Criticism on and
I After encountering Gödel this was deemed interpretations
of the
unsatisfactory and the ’thesis’ was changed. Church-Turing
Thesis
New solution: Variations on
the
I Identify effectively calculable functions with the Church-Turing
Thesis
recursive functions. Physical/Strong
Church-Turing Thesis
Feasibility
I One identification is done in the context of calculability Thesis/Extended
Church-Turing Thesis
Quantum
in a logic. Complexity-Theoretic
Church-Turing Thesis

I Problem: steps of the proof were not proved recursive Concluding

remarks
(or finite and mechanical).

7
The Church Thesis

I Church wanted to define this notion of effectively The

Church-Turing
calculable by using λ-definable functions. Thesis

Criticism on and
I After encountering Gödel this was deemed interpretations
of the
unsatisfactory and the ’thesis’ was changed. Church-Turing
Thesis
New solution: Variations on
the
I Identify effectively calculable functions with the Church-Turing
Thesis
recursive functions. Physical/Strong
Church-Turing Thesis
Feasibility
I One identification is done in the context of calculability Thesis/Extended
Church-Turing Thesis
Quantum
in a logic. Complexity-Theoretic
Church-Turing Thesis

I Problem: steps of the proof were not proved recursive Concluding

remarks
(or finite and mechanical).

7
The Church Thesis by Church

The
Church’s formulation (Church1936): Church-Turing
Thesis
We now define the notion, already discussed, of an Criticism on and
interpretations
effectively calculable function of positive integers of the
Church-Turing
by identifying it with the notion of a recursive Thesis

function of positive integers (or a λ-definable Variations on

the
function of positive integers). This definition is Church-Turing
Thesis
thought to be justified by the considerations which Physical/Strong
Church-Turing Thesis

follow, so far as positive justification can ever be Feasibility

Thesis/Extended
Church-Turing Thesis
obtained for the selection of formal definition to Quantum
Complexity-Theoretic

correspond to an intuitive notion. Church-Turing Thesis

Concluding
remarks

8
The Church Thesis in short (Sieg)

The
Church-Turing
Thesis

Criticism on and
interpretations
Due to Sieg (Sieg1997): of the
Church-Turing
Thesis
The steps of any effective procedure (governing
Variations on
proofs in a system of symbolic logic) must be the
Church-Turing
recursive. Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

9
Alan Turing (1912-1954)

Turing wanted to define the notion of effective calculability

The
or informal computability in terms of an idealized Church-Turing
Thesis
human/computor.
Criticism on and
interpretations
of the
Church-Turing
Thesis

Variations on
the
Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

10
The Turing Thesis

I The processes or steps taken by this idealized human

The
are formalised and restrained. Conditions as by Sieg Church-Turing
Thesis
(Sieg2001):
Criticism on and
• (B) (Boundedness) There is a fixed bound on the interpretations
of the
number of configurations a computer can immediately Church-Turing
Thesis
recognize.
Variations on
• (L) (Locality) A computor can change only immediately the
Church-Turing
recognizable (sub-)configurations. Thesis
• (D) (Determinacy) The immediately recognizable Physical/Strong
Church-Turing Thesis

(sub-)configuration determines uniquely the next Feasibility

Thesis/Extended
Church-Turing Thesis
computation step (and id). Quantum
Complexity-Theoretic
Church-Turing Thesis
I Turing then argued that number theoretic functions
Concluding
calculable by such a computor are also computable by remarks

a Turing machine.

11
The Turing Thesis

I The processes or steps taken by this idealized human

The
are formalised and restrained. Conditions as by Sieg Church-Turing
Thesis
(Sieg2001):
Criticism on and
• (B) (Boundedness) There is a fixed bound on the interpretations
of the
number of configurations a computer can immediately Church-Turing
Thesis
recognize.
Variations on
• (L) (Locality) A computor can change only immediately the
Church-Turing
recognizable (sub-)configurations. Thesis
• (D) (Determinacy) The immediately recognizable Physical/Strong
Church-Turing Thesis

(sub-)configuration determines uniquely the next Feasibility

Thesis/Extended
Church-Turing Thesis
computation step (and id). Quantum
Complexity-Theoretic
Church-Turing Thesis
I Turing then argued that number theoretic functions
Concluding
calculable by such a computor are also computable by remarks

a Turing machine.

11
The Turing Thesis

I The processes or steps taken by this idealized human

The
are formalised and restrained. Conditions as by Sieg Church-Turing
Thesis
(Sieg2001):
Criticism on and
• (B) (Boundedness) There is a fixed bound on the interpretations
of the
number of configurations a computer can immediately Church-Turing
Thesis
recognize.
Variations on
• (L) (Locality) A computor can change only immediately the
Church-Turing
recognizable (sub-)configurations. Thesis
• (D) (Determinacy) The immediately recognizable Physical/Strong
Church-Turing Thesis

(sub-)configuration determines uniquely the next Feasibility

Thesis/Extended
Church-Turing Thesis
computation step (and id). Quantum
Complexity-Theoretic
Church-Turing Thesis
I Turing then argued that number theoretic functions
Concluding
calculable by such a computor are also computable by remarks

a Turing machine.

11
The Turing Thesis in short

The
Church-Turing
Thesis

Criticism on and
Adaptation of Shagrir (Shagrir2002) which he calls the interpretations
of the
Gandy-Sieg account: Church-Turing
Thesis

Any function that can be computed by a computor, Variations on

the
with the previous restrictions (B, L and D), is Turing Church-Turing
Thesis
computable (in the sense of a Turing machine). Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

12
The Church-Turing Thesis

The
Church-Turing
Thesis

Criticism on and
interpretations
of the
The two short formulations combined: Church-Turing
Thesis
Any effectively calculable function is Turing Variations on
the
computable. Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

13
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

14
Interpretation of Turing’s Thesis(1)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Any function that can be computed by a computor Thesis

with the previous restrictions is Turing computable Criticism on and

interpretations
(in the sense of a Turing machine). of the
Church-Turing
Thesis

Variations on
the
I This formulation uses computors, and thus humans, to Church-Turing
Thesis
formulate the concept effective calculability. Physical/Strong
Church-Turing Thesis
Feasibility
I Church, as can be seen in his review (Church1937), also Thesis/Extended
Church-Turing Thesis

probably understood Turing’s Thesis as a thesis about Quantum

Complexity-Theoretic
Church-Turing Thesis
computors, not about computing machines. Concluding
(Hodges2006 and Shagrir2002) remarks

15
Interpretation of Turing’s Thesis(1)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Any function that can be computed by a computor Thesis

with the previous restrictions is Turing computable Criticism on and

interpretations
(in the sense of a Turing machine). of the
Church-Turing
Thesis

Variations on
the
I This formulation uses computors, and thus humans, to Church-Turing
Thesis
formulate the concept effective calculability. Physical/Strong
Church-Turing Thesis
Feasibility
I Church, as can be seen in his review (Church1937), also Thesis/Extended
Church-Turing Thesis

probably understood Turing’s Thesis as a thesis about Quantum

Complexity-Theoretic
Church-Turing Thesis
computors, not about computing machines. Concluding
(Hodges2006 and Shagrir2002) remarks

15
Interpretation of Turing’s Thesis(1)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Any function that can be computed by a computor Thesis

with the previous restrictions is Turing computable Criticism on and

interpretations
(in the sense of a Turing machine). of the
Church-Turing
Thesis

Variations on
the
I This formulation uses computors, and thus humans, to Church-Turing
Thesis
formulate the concept effective calculability. Physical/Strong
Church-Turing Thesis
Feasibility
I Church, as can be seen in his review (Church1937), also Thesis/Extended
Church-Turing Thesis

probably understood Turing’s Thesis as a thesis about Quantum

Complexity-Theoretic
Church-Turing Thesis
computors, not about computing machines. Concluding
(Hodges2006 and Shagrir2002) remarks

15
Interpretation of Turing’s Thesis(2)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Thesis
Any function that can be computed by a computor
Criticism on and
with the previous restrictions is Turing computable interpretations
of the
(in the sense of a Turing machine). Church-Turing
Thesis

Variations on
the
Church-Turing
I This is in contrast to common modern opinions and Thesis
Physical/Strong
interpretations of the Church-Turing Thesis. Church-Turing Thesis
Feasibility
Thesis/Extended
I The Church-Turing Thesis in current computer science Church-Turing Thesis
Quantum

is often understood in terms of finite machine Complexity-Theoretic

Church-Turing Thesis

computation in contrast to human computation. Concluding

remarks

16
Interpretation of Turing’s Thesis(2)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Thesis
Any function that can be computed by a computor
Criticism on and
with the previous restrictions is Turing computable interpretations
of the
(in the sense of a Turing machine). Church-Turing
Thesis

Variations on
the
Church-Turing
I This is in contrast to common modern opinions and Thesis
Physical/Strong
interpretations of the Church-Turing Thesis. Church-Turing Thesis
Feasibility
Thesis/Extended
I The Church-Turing Thesis in current computer science Church-Turing Thesis
Quantum

is often understood in terms of finite machine Complexity-Theoretic

Church-Turing Thesis

computation in contrast to human computation. Concluding

remarks

16
Interpretation of Turing’s Thesis(2)

Again the interpretation of Gandy-Sieg: The

Church-Turing
Thesis
Any function that can be computed by a computor
Criticism on and
with the previous restrictions is Turing computable interpretations
of the
(in the sense of a Turing machine). Church-Turing
Thesis

Variations on
the
Church-Turing
I This is in contrast to common modern opinions and Thesis
Physical/Strong
interpretations of the Church-Turing Thesis. Church-Turing Thesis
Feasibility
Thesis/Extended
I The Church-Turing Thesis in current computer science Church-Turing Thesis
Quantum

is often understood in terms of finite machine Complexity-Theoretic

Church-Turing Thesis

computation in contrast to human computation. Concluding

remarks

16
Interpretation of the (Church-)Turing Thesis

The
Church-Turing
Thesis

Criticism on and
I The Gandy-Sieg account of an effectively calculable interpretations
of the
function for the Church-Turing Thesis is an Church-Turing
Thesis
interpretation phrased in computors/idealized human Variations on
computers, whereas the other view is machine based. the
Church-Turing
Thesis
I So in fact we can formulate two versions of the Physical/Strong
Church-Turing Thesis
Church-Turing Thesis (as done in Shagrir2002). Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

17
Interpretation of the (Church-)Turing Thesis

The
Church-Turing
Thesis

Criticism on and
I The Gandy-Sieg account of an effectively calculable interpretations
of the
function for the Church-Turing Thesis is an Church-Turing
Thesis
interpretation phrased in computors/idealized human Variations on
computers, whereas the other view is machine based. the
Church-Turing
Thesis
I So in fact we can formulate two versions of the Physical/Strong
Church-Turing Thesis
Church-Turing Thesis (as done in Shagrir2002). Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

17
Human and Machine Church-Turing Thesis

The
Church-Turing
The human version of the Church-Turing Thesis: Thesis

Criticism on and
Any function (of positive integers) that can be interpretations
of the
computed by a human computer is Turing Church-Turing
Thesis
computable.
Variations on
the
The machine version of the Church-Turing Thesis: Church-Turing
Thesis
Any function (of positive integers) that can be Physical/Strong
Church-Turing Thesis
Feasibility
computed by a finite machine is Turing Thesis/Extended
Church-Turing Thesis

computable. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

18
Human and Machine Church-Turing Thesis

The
Church-Turing
The human version of the Church-Turing Thesis: Thesis

Criticism on and
Any function (of positive integers) that can be interpretations
of the
computed by a human computer is Turing Church-Turing
Thesis
computable.
Variations on
the
The machine version of the Church-Turing Thesis: Church-Turing
Thesis
Any function (of positive integers) that can be Physical/Strong
Church-Turing Thesis
Feasibility
computed by a finite machine is Turing Thesis/Extended
Church-Turing Thesis

computable. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

18
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

19
Variations on the Church-Turing Thesis

The
Church-Turing
Thesis

Criticism on and
interpretations
of the
I Quite some variants on the Church-Turing Thesis have Church-Turing
Thesis
been proposed.
Variations on
I Also motivated by the two possible interpretations the
Church-Turing
Thesis
given before. Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

20
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

21
Physical Church-Turing Thesis (Shagrir)
I An abstraction quickly made from human computers
and finite machines is the abstraction to physical The
Church-Turing
systems in general. Thesis

I This abstraction also serves as a distinction between Criticism on and

interpretations
proper Church-Turing Thesis as defined before and the of the
Church-Turing
Thesis
Physical Church-Turing Thesis (PCTT).
Variations on
I This is also called the Strong Church-Turing Thesis the
Church-Turing
expressing that Turing Machines capture all Thesis
Physical/Strong

computation, so models of computation more Church-Turing Thesis

Feasibility
Thesis/Extended
expressive than TMs are impossible. Church-Turing Thesis
Quantum
Complexity-Theoretic

PCTT as formulated in Shagrir2002: Church-Turing Thesis

Concluding
Any function (of positive integers) that can be remarks

computed by a physical system is

Turing-computable.
22
Physical Church-Turing Thesis (Shagrir)
I An abstraction quickly made from human computers
and finite machines is the abstraction to physical The
Church-Turing
systems in general. Thesis

I This abstraction also serves as a distinction between Criticism on and

interpretations
proper Church-Turing Thesis as defined before and the of the
Church-Turing
Thesis
Physical Church-Turing Thesis (PCTT).
Variations on
I This is also called the Strong Church-Turing Thesis the
Church-Turing
expressing that Turing Machines capture all Thesis
Physical/Strong

computation, so models of computation more Church-Turing Thesis

Feasibility
Thesis/Extended
expressive than TMs are impossible. Church-Turing Thesis
Quantum
Complexity-Theoretic

PCTT as formulated in Shagrir2002: Church-Turing Thesis

Concluding
Any function (of positive integers) that can be remarks

computed by a physical system is

Turing-computable.
22
Physical Church-Turing Thesis (Shagrir)
I An abstraction quickly made from human computers
and finite machines is the abstraction to physical The
Church-Turing
systems in general. Thesis

I This abstraction also serves as a distinction between Criticism on and

interpretations
proper Church-Turing Thesis as defined before and the of the
Church-Turing
Thesis
Physical Church-Turing Thesis (PCTT).
Variations on
I This is also called the Strong Church-Turing Thesis the
Church-Turing
expressing that Turing Machines capture all Thesis
Physical/Strong

computation, so models of computation more Church-Turing Thesis

Feasibility
Thesis/Extended
expressive than TMs are impossible. Church-Turing Thesis
Quantum
Complexity-Theoretic

PCTT as formulated in Shagrir2002: Church-Turing Thesis

Concluding
Any function (of positive integers) that can be remarks

computed by a physical system is

Turing-computable.
22
Physical Church-Turing Thesis (Piccinini)

I Piccinini makes a further distinction (Piccinini2007) in

the PCTT. The
Church-Turing
Thesis
I A modest version which is supposedly equal to the
Criticism on and
previous formulation by Shagrir. interpretations
of the
I A bold version that possibly broadens the scope of Church-Turing
Thesis
effectively calculable functions. Variations on
the
Church-Turing
Modest PCTT: Thesis
... the functions whose values are generated by Physical/Strong
Church-Turing Thesis
Feasibility
computing mechanisms are Turing-computable. Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Bold PCTT: Church-Turing Thesis

Concluding
... the functions whose values are generated (by remarks
computation or any other means) by physical
systems are Turing-computable.

23
Physical Church-Turing Thesis (Piccinini)

I Piccinini makes a further distinction (Piccinini2007) in

the PCTT. The
Church-Turing
Thesis
I A modest version which is supposedly equal to the
Criticism on and
previous formulation by Shagrir. interpretations
of the
I A bold version that possibly broadens the scope of Church-Turing
Thesis
effectively calculable functions. Variations on
the
Church-Turing
Modest PCTT: Thesis
... the functions whose values are generated by Physical/Strong
Church-Turing Thesis
Feasibility
computing mechanisms are Turing-computable. Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Bold PCTT: Church-Turing Thesis

Concluding
... the functions whose values are generated (by remarks
computation or any other means) by physical
systems are Turing-computable.

23
Physical Church-Turing Thesis (Piccinini)

I Piccinini makes a further distinction (Piccinini2007) in

the PCTT. The
Church-Turing
Thesis
I A modest version which is supposedly equal to the
Criticism on and
previous formulation by Shagrir. interpretations
of the
I A bold version that possibly broadens the scope of Church-Turing
Thesis
effectively calculable functions. Variations on
the
Church-Turing
Modest PCTT: Thesis
... the functions whose values are generated by Physical/Strong
Church-Turing Thesis
Feasibility
computing mechanisms are Turing-computable. Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Bold PCTT: Church-Turing Thesis

Concluding
... the functions whose values are generated (by remarks
computation or any other means) by physical
systems are Turing-computable.

23
Physical Church-Turing Thesis (Piccinini)

I Piccinini makes a further distinction (Piccinini2007) in

the PCTT. The
Church-Turing
Thesis
I A modest version which is supposedly equal to the
Criticism on and
previous formulation by Shagrir. interpretations
of the
I A bold version that possibly broadens the scope of Church-Turing
Thesis
effectively calculable functions. Variations on
the
Church-Turing
Modest PCTT: Thesis
... the functions whose values are generated by Physical/Strong
Church-Turing Thesis
Feasibility
computing mechanisms are Turing-computable. Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Bold PCTT: Church-Turing Thesis

Concluding
... the functions whose values are generated (by remarks
computation or any other means) by physical
systems are Turing-computable.

23
Physical Church-Turing Thesis (Piccinini)

I Piccinini makes a further distinction (Piccinini2007) in

the PCTT. The
Church-Turing
Thesis
I A modest version which is supposedly equal to the
Criticism on and
previous formulation by Shagrir. interpretations
of the
I A bold version that possibly broadens the scope of Church-Turing
Thesis
effectively calculable functions. Variations on
the
Church-Turing
Modest PCTT: Thesis
... the functions whose values are generated by Physical/Strong
Church-Turing Thesis
Feasibility
computing mechanisms are Turing-computable. Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Bold PCTT: Church-Turing Thesis

Concluding
... the functions whose values are generated (by remarks
computation or any other means) by physical
systems are Turing-computable.

23
Criticism on the modest PCTT (Copeland)

The
Church-Turing
Thesis
I Copeland has a lot of criticism on the modest version of
Criticism on and
the Church-Turing Thesis and also already on the interpretations
of the
machine version of the Church-Turing Thesis. Church-Turing
Thesis
I He suggests there could exist physical machines Variations on
the
capable of performing computations not computable by Church-Turing
Thesis
Turing Machines. Physical/Strong
Church-Turing Thesis
Feasibility
I This field is called hypercomputation and is still Thesis/Extended
Church-Turing Thesis

speculative. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

24
Criticism on the modest PCTT (Copeland)

The
Church-Turing
Thesis
I Copeland has a lot of criticism on the modest version of
Criticism on and
the Church-Turing Thesis and also already on the interpretations
of the
machine version of the Church-Turing Thesis. Church-Turing
Thesis
I He suggests there could exist physical machines Variations on
the
capable of performing computations not computable by Church-Turing
Thesis
Turing Machines. Physical/Strong
Church-Turing Thesis
Feasibility
I This field is called hypercomputation and is still Thesis/Extended
Church-Turing Thesis

speculative. Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

24
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

25
The Extended Church-Turing Thesis (1)

The
I Formulated early by Parberry in 1986 using a parallel Church-Turing
Thesis
computation thesis.
Criticism on and
interpretations
I Yao (Yao2003) calls it an extension of the classical of the
Church-Turing
Church-Turing Thesis, Extended Church-Turing Thesis. Thesis

I Beside the standard thesis, the Turing machine is also Variations on

the
deemed as efficient as any computing device can be. Church-Turing
Thesis
Physical/Strong

Extended Church-Turing Thesis (adaptation of Yao2003): Church-Turing Thesis

Feasibility
Thesis/Extended

Any effectively calculable function is Turing Church-Turing Thesis

Quantum
Complexity-Theoretic
computable and efficiently computable using Church-Turing Thesis

Turing machines. Concluding

remarks

26
The Extended Church-Turing Thesis (1)

The
I Formulated early by Parberry in 1986 using a parallel Church-Turing
Thesis
computation thesis.
Criticism on and
interpretations
I Yao (Yao2003) calls it an extension of the classical of the
Church-Turing
Church-Turing Thesis, Extended Church-Turing Thesis. Thesis

I Beside the standard thesis, the Turing machine is also Variations on

the
deemed as efficient as any computing device can be. Church-Turing
Thesis
Physical/Strong

Extended Church-Turing Thesis (adaptation of Yao2003): Church-Turing Thesis

Feasibility
Thesis/Extended

Any effectively calculable function is Turing Church-Turing Thesis

Quantum
Complexity-Theoretic
computable and efficiently computable using Church-Turing Thesis

Turing machines. Concluding

remarks

26
The Extended Church-Turing Thesis (1)

The
I Formulated early by Parberry in 1986 using a parallel Church-Turing
Thesis
computation thesis.
Criticism on and
interpretations
I Yao (Yao2003) calls it an extension of the classical of the
Church-Turing
Church-Turing Thesis, Extended Church-Turing Thesis. Thesis

I Beside the standard thesis, the Turing machine is also Variations on

the
deemed as efficient as any computing device can be. Church-Turing
Thesis
Physical/Strong

Extended Church-Turing Thesis (adaptation of Yao2003): Church-Turing Thesis

Feasibility
Thesis/Extended

Any effectively calculable function is Turing Church-Turing Thesis

Quantum
Complexity-Theoretic
computable and efficiently computable using Church-Turing Thesis

Turing machines. Concluding

remarks

26
The Extended Church-Turing Thesis (1)

The
I Formulated early by Parberry in 1986 using a parallel Church-Turing
Thesis
computation thesis.
Criticism on and
interpretations
I Yao (Yao2003) calls it an extension of the classical of the
Church-Turing
Church-Turing Thesis, Extended Church-Turing Thesis. Thesis

I Beside the standard thesis, the Turing machine is also Variations on

the
deemed as efficient as any computing device can be. Church-Turing
Thesis
Physical/Strong

Extended Church-Turing Thesis (adaptation of Yao2003): Church-Turing Thesis

Feasibility
Thesis/Extended

Any effectively calculable function is Turing Church-Turing Thesis

Quantum
Complexity-Theoretic
computable and efficiently computable using Church-Turing Thesis

Turing machines. Concluding

remarks

26
The Extended Church-Turing Thesis (2)

The
Church-Turing
Thesis
I The Extended Church-Turing Thesis can be used as an Criticism on and
interpretations
interesting starting point for discussion. of the
Church-Turing
Thesis
I Discuss physical realisation of computing machines
Variations on
that are capable of solving some problems much faster the
Church-Turing
than the standard computational model. Thesis
Physical/Strong
Church-Turing Thesis
I Does not immediately go into the realm of quantum Feasibility
Thesis/Extended
mechanics. Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

27
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

28
Quantum Complexity-Theoretic Church-Turing
Thesis
The
Church-Turing
Thesis
I Quantum Complexity-Theoretic Church-Turing Thesis
Criticism on and
was formulated by Bernstein and Vazirani in 1997. interpretations
of the
I A variant formulation of the Church-Turing Thesis Church-Turing
Thesis
closely related to the Extended Church-Turing Thesis. Variations on
the
• Would invalidate the extended Church-Turing Thesis Church-Turing
Thesis
because the quantom model of computation is more Physical/Strong

efficient than a normal Turing machine. Church-Turing Thesis

Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum Complexity-Theoretic Church-Turing Thesis: Quantum
Complexity-Theoretic
Church-Turing Thesis
A quantum Turing machine can efficiently simulate
Concluding
any realistic model of computation. remarks

29
Quantum Complexity-Theoretic Church-Turing
Thesis
The
Church-Turing
Thesis
I Quantum Complexity-Theoretic Church-Turing Thesis
Criticism on and
was formulated by Bernstein and Vazirani in 1997. interpretations
of the
I A variant formulation of the Church-Turing Thesis Church-Turing
Thesis
closely related to the Extended Church-Turing Thesis. Variations on
the
• Would invalidate the extended Church-Turing Thesis Church-Turing
Thesis
because the quantom model of computation is more Physical/Strong

efficient than a normal Turing machine. Church-Turing Thesis

Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum Complexity-Theoretic Church-Turing Thesis: Quantum
Complexity-Theoretic
Church-Turing Thesis
A quantum Turing machine can efficiently simulate
Concluding
any realistic model of computation. remarks

29
Quantum Complexity-Theoretic Church-Turing
Thesis
The
Church-Turing
Thesis
I Quantum Complexity-Theoretic Church-Turing Thesis
Criticism on and
was formulated by Bernstein and Vazirani in 1997. interpretations
of the
I A variant formulation of the Church-Turing Thesis Church-Turing
Thesis
closely related to the Extended Church-Turing Thesis. Variations on
the
• Would invalidate the extended Church-Turing Thesis Church-Turing
Thesis
because the quantom model of computation is more Physical/Strong

efficient than a normal Turing machine. Church-Turing Thesis

Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum Complexity-Theoretic Church-Turing Thesis: Quantum
Complexity-Theoretic
Church-Turing Thesis
A quantum Turing machine can efficiently simulate
Concluding
any realistic model of computation. remarks

29
Quantum Complexity-Theoretic Church-Turing
Thesis
The
Church-Turing
Thesis
I Quantum Complexity-Theoretic Church-Turing Thesis
Criticism on and
was formulated by Bernstein and Vazirani in 1997. interpretations
of the
I A variant formulation of the Church-Turing Thesis Church-Turing
Thesis
closely related to the Extended Church-Turing Thesis. Variations on
the
• Would invalidate the extended Church-Turing Thesis Church-Turing
Thesis
because the quantom model of computation is more Physical/Strong

efficient than a normal Turing machine. Church-Turing Thesis

Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum Complexity-Theoretic Church-Turing Thesis: Quantum
Complexity-Theoretic
Church-Turing Thesis
A quantum Turing machine can efficiently simulate
Concluding
any realistic model of computation. remarks

29
Outline

The
The Church-Turing Thesis Church-Turing
Thesis

Criticism on and
interpretations
Criticism on and interpretations of the Church-Turing Thesis of the
Church-Turing
Thesis

Variations on
Variations on the Church-Turing Thesis the
Church-Turing
Physical/Strong Church-Turing Thesis Thesis
Physical/Strong
Feasibility Thesis/Extended Church-Turing Thesis Church-Turing Thesis
Feasibility

Quantum Complexity-Theoretic Church-Turing Thesis Thesis/Extended

Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding remarks Concluding

remarks

30
Summary

The
Church-Turing
Thesis
I The Church-Turing Thesis can be described as a thesis Criticism on and
interpretations
concerning computors or finite machines. of the
Church-Turing
Thesis
I Terminology, implications and exact meaning of the
Variations on
Church-Turing Thesis are still discussed. the
Church-Turing
I Variations can put constraints or give more freedom on Thesis
Physical/Strong

the physicality and efficiency of the Church-Turing Thesis

Feasibility
Thesis/Extended
computers/computors. Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

31
Further reading

The
Church-Turing
Some other interesting topics not discussed due to a lack of Thesis
time: Criticism on and
interpretations
I Interactive Turing machines (possibly with advice). of the
Church-Turing
Thesis
I All knowing entities that can be used in computations
Variations on
called oracles. the
Church-Turing
Thesis
I Gandy machines, a concept relating to physical Physical/Strong
Church-Turing Thesis
machines. Feasibility
Thesis/Extended
Church-Turing Thesis
I Super-recursive algorithms, a class of algorithms that Quantum
Complexity-Theoretic
compute more than Turing machines. Church-Turing Thesis

Concluding
remarks

32
References
I Bernstein, E; Vazirani, U. (1997), ’Quantum complexity
theory’, SIAM Journal on Computing 26 (5): pp. The
Church-Turing
1411-1473. Thesis

Criticism on and
I Church, A. (1936), ’An Unsolvable Problem of interpretations
of the
Elementary Number Theory’, American Journal of Church-Turing
Thesis
Mathematics 58, pp. 345-363.
Variations on
I Church, A. (1937), ’Review of Turing( 1936)’, Journal of the
Church-Turing
Symbolic Logic 2, pp. 42-43. Thesis
Physical/Strong
Church-Turing Thesis
I Copeland, J.; Proudfoot, D. (1999), ’Alan Turing’s Feasibility
Thesis/Extended

Forgotten Ideas in Computer Science Scientific Church-Turing Thesis

Quantum
Complexity-Theoretic
American’, vol. 280 (1999), pp. 99-103. Church-Turing Thesis

Concluding
I Hodges, A. (2006), ’Did Church and Turing have a thesis remarks

about machines?’, Church’s Thesis after 70 years

Olszewski, Adam (ed.).
33
References

I Parberry, I. (1986), ’Parallel speedup of sequential The

Church-Turing
machines: a defense of parallel computation thesis,’ Thesis

Criticism on and
ACM SIGACT News, Volume 18, Issue 1, pp. 54-67. interpretations
of the
I Piccinini, G. (2007), ’Computationalism, the Church-Turing
Thesis
Church-Turing Thesis, and the Church-Turing Fallacy’, Variations on
the
Synthese, 154.1, pp. 97-120. Church-Turing
Thesis
I Shagrir, O. (2002), ’Effective Computation by Humans Physical/Strong
Church-Turing Thesis

and Machines’, Minds Mach. 12, 2, pp. 221-240. Feasibility

Thesis/Extended
Church-Turing Thesis
I Sieg, W. (1997), ’Step by Recursive Step: Church’s Quantum
Complexity-Theoretic
Church-Turing Thesis
Analysis of Effective Calculability’, Bulletin of Symbolic
Concluding
Logic 2, pp. 154-180. remarks

34
References

The
I Sieg, W. (2001), ’Calculation by Man and Machine: Church-Turing
Thesis
Conceptual Analysis’, in W. Sieg, R. Sommer and C.
Criticism on and
Talcott, eds., Reflections on the Foundations of interpretations
of the
Mathematics (Essays in Honor of Solomon Feferman), Church-Turing
Thesis
Volume 15 of Lectures Notes in Logic, Association of
Variations on
Symbolic Logic, pp. 387-406. the
Church-Turing
Thesis
I Soare, R (1999), ’The history and concept of Physical/Strong
Church-Turing Thesis
computability, in Handbook of Computability Theory, Feasibility
Thesis/Extended

E.R. Griffor (ed.); Elsevier, 3-36. Church-Turing Thesis

Quantum
Complexity-Theoretic
I Yao, A. (2003), ’Classical physics and the Church-Turing Thesis

Concluding
Church–Turing Thesis’, JACM 50, 100. remarks

35
Questions

The
Church-Turing
Thesis

Criticism on and
interpretations
of the
Church-Turing
Thesis

Variations on
the
Church-Turing
Thesis
Physical/Strong
Church-Turing Thesis
Feasibility
Thesis/Extended
Church-Turing Thesis
Quantum
Complexity-Theoretic
Church-Turing Thesis

Concluding
remarks

36