The Physical Church–Turing Thesis: Modest or Bold?

  title={The Physical Church–Turing Thesis: Modest or Bold?},
  author={Gualtiero Piccinini},
  journal={The British Journal for the Philosophy of Science},
  pages={733 - 769}
  • G. Piccinini
  • Published 1 December 2011
  • Philosophy
  • The British Journal for the Philosophy of Science
This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT— and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a… 

Physical Computability Theses

All three variants of the physical Church-Turing Thesis (PCTT) are concluded that all three variants are best viewed as open empirical hypotheses.

A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer

It is suggested that even the foundations of quantum theory and, ultimately, quantum gravity may play an important role in determining the validity of the physical Church–Turing thesis.

A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer

This essay will honour Istvan’s seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987, by modestly proposing how the concrete implementation in Nemeti and David might be complemented by a quantum-information-theoretic communication protocol.

How to Make a Meaningful Comparison of Models: The Church–Turing Thesis Over the Reals

It is argued that it is possible in both cases to defend an equivalent of the Church–Turing thesis over the reals, and some methodological caveats on the comparison of different computational models are learned.

Discussion Notes on Physical Computation

Historically the Church-Turing thesis (CTT) has been an assertion about the limits of effective computation. The CTT states that the class of effectively computable functions coincides with the set

Relativistic computation

This chapter focuses on relativistic computers and on their challenge to the physical Church-Turing thesis (PhCT), the belief that whatever physical computing device or physical thought experiment that will be designed by any future civilization, it will always be simulateable by a Turing machine, in some sense.

Should Computability Be Epistemic? a Logical and Physical Point of View

Although the formalizations of computability provided in the 1930s have proven to be equivalent, two different accounts of computability may be distinguished regarding computability as an epistemic

What is the Church-Turing Thesis?

We aim to put some order to the multiple interpretations of the ChurchTuring Thesis and to the different approaches taken to prove or disprove it. [Answer:] Rosser and its inventor proved that its

On More or Less Appropriate Notions of 'Computation'

This paper presents some arguments about which notions of “computation” may be considered “reasonably acceptable” for the authors' own historic era, and emphasizes that every science-philosophical notion has its own long-term historical semantics which cannot be fixed once and forever.

How Not To Use the Church-Turing Thesis Against Platonism

Olszewski claims that the Church-Turing thesis can be used in an argument against platonism in philosophy of mathematics. The key step of his argument employs an example of a supposedly effectively



Is the Church-Turing thesis true?

It is argued that mundane procedures can be said to be effective in the same sense in which Turing machine procedures can been said toBe effective, and that mundane Procedures differ from Turing machine Procedures in a fundamental way, viz., the former, but not the latter, generate causal processes.

Computation, hypercomputation, and physical science

Physical Hypercomputation and the Church–Turing Thesis

It is argued that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's thesis.

From Logic to Physics: How the Meaning of Computation Changed over Time

The Church-Turing thesis cannot be proved in the same sense that a mathematical proposition is provable, however, it can be refuted by an example of a function which is not Turing computable, but is nevertheless calculable by some procedure that is intuitively acceptable.

Proving Church's Thesis

The talk reflects recent joint work with Nachum Dershowitz on Church’s thesis, which asserts that every computable numerical partial function is partial recursive.

SAD Computers and Two Versions of the Church–Turing Thesis

  • Tim Button
  • Computer Science
    The British Journal for the Philosophy of Science
  • 2009
This paper first considers deterministic and probabilistic barriers to the physical possibility of SAD computation, and argues against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur.

Church's Thesis and the Conceptual Analysis of Computability

It is argued that purported conceptual analyses based upon Turing’s work involve a subtle but persistent circularity in their analysis of computability.

Effective Computation by Humans and Machines

It is argued that if the Gandy–Sieg account is correct, then the notion of effective computability has changed after 1936, and today computer scientists view effective computable in terms of finite machine computation.

Hypercomputation and the Physical Church‐Turing Thesis

  • Paolo Cotogno
  • Philosophy, Computer Science
    The British Journal for the Philosophy of Science
  • 2003
A version of the Church‐Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical,