Classical physics and the Church--Turing Thesis
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence suggests that this might be the case in the quantum world. But the question is of great interest even in the realm of classical physics. In this article, we observe that there is fundamental tension between the Extended Church--Turing Thesis and the existence of numerous seemingly intractable computational problems arising from classical physics. Efforts to resolve this incompatibility could both advance our knowledge of the theory of computation, as well as serve the needs of scientific computing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Cited by
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
“The potential of a quantum computer to solve problems more efficiently than a Turing machine would rock the foundation of the extended Church-Turing thesis [49].”
BackgroundInfluentialThe Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Blum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
Metadata
- Authors
- Yao, A. C.-C.
- Venue
- Journal of the ACM
- Published
- 2003-01
- Volume
- 50
- Issue
- 1
- Pages
- 100-105
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W296017150
- Cited by
- 74
- References
- 3
- FWCI
- 6.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.