2011
DOI: 10.1093/bjps/axr016
|View full text |Cite
|
Sign up to set email alerts
|

The Physical Church–Turing Thesis: Modest or Bold?

Abstract: This is a preprint of a paper whose final and definitive form will be published in the

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0
1

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 39 publications
(44 citation statements)
references
References 84 publications
0
43
0
1
Order By: Relevance
“…Bold versions of the thesis state, roughly, that "Any physical process can be simulated by some Turing machine." 31 The Church-Turing-Deutsch-Wolfram thesis (CTDW) is an example, though Piccinini emphasized that the bold versions proposed by different researchers are often "logically independent of one another" and that, unlike the different formulations of CTT-O, which exhibit confluence, the different bold formulations in fact exhibit "lack of confluence." 31 CTDW and other bold forms are too weak to rule out the uncomputability scenarios described by Cubitt et al 14 and by Eisert et al 19 This is because the physical processes involved in these scenarios may, so far as we know, be Turing-computable; it is possible that each process can be simulated by a Turing machine, to any required degree of accuracy, and yet the answers to certain physical questions about the processes are, in general, uncomputable.…”
Section: Physical Computabilitymentioning
confidence: 99%
“…Bold versions of the thesis state, roughly, that "Any physical process can be simulated by some Turing machine." 31 The Church-Turing-Deutsch-Wolfram thesis (CTDW) is an example, though Piccinini emphasized that the bold versions proposed by different researchers are often "logically independent of one another" and that, unlike the different formulations of CTT-O, which exhibit confluence, the different bold formulations in fact exhibit "lack of confluence." 31 CTDW and other bold forms are too weak to rule out the uncomputability scenarios described by Cubitt et al 14 and by Eisert et al 19 This is because the physical processes involved in these scenarios may, so far as we know, be Turing-computable; it is possible that each process can be simulated by a Turing machine, to any required degree of accuracy, and yet the answers to certain physical questions about the processes are, in general, uncomputable.…”
Section: Physical Computabilitymentioning
confidence: 99%
“…Such epistemic desire 'felt' by a user can only be fulfilled if a computation's output, when it eventually appears, can genuinely inform the user in a non-trivial manner (Oberholzer & Gruner, 2016). The 'epistemic desire' (Piccinini, 2011)…”
Section: Our Notion Of 'Computation'mentioning
confidence: 99%
“…Computational processes like the one described in Equation (1) do not allow to identify a specific couple of input-output values, within the transition from input and output registers. This might be considered a minor problem, but it actually cause difficulties in satisfying one of the constraints for considering an effective procedure as evaluating a function [13], namely that one of reliability. More than that it is possible to highlight other descriptions of processes such as Equation (1) which do not support QPT and are perfectly coherent with both formalism and observation.…”
Section: A Joint Assumption For Pit and Qpt?mentioning
confidence: 99%