The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Computability in Analysis and Physics
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
Foundations of Modern Analysis
(1969) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6009-x · Cited by 3,372
Theory of Recursive Functions and Effective Computability.
Feferman, S., & Rogers, H. (1969) · The American Mathematical Monthly · doi:10.2307/2316720 · Cited by 2,788
Ahlfors, L. V. (1979) · Cited by 2,282
Riesz, F. (1955) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,001
Shohat, J., & Tamarkin, J. D. (1943) · Mathematical surveys and monographs · doi:10.1090/surv/001 · Cited by 1,688
Recursively enumerable sets and degrees
Soare, R. I. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14552-2 · Cited by 1,520
Cited by
The dynamical hypothesis in cognitive science
van Gelder, T. (1998) · Behavioral and Brain Sciences · doi:10.1017/s0140525x98001733 · Cited by 1,331
A Computational Foundation for the Study of Cognition
Chalmers, D. J. (2011) · Journal of Cognitive Science · doi:10.17791/jcs.2011.12.4.325 · Cited by 294
Invariant Manifolds for Physical and Chemical Kinetics
N. Gorban, A., & V. Karlin, I. (2005) · Lecture Notes in Physics · doi:10.1007/b98103 · Cited by 264
Undecidability of the spectral gap
Cubitt, T. S., Perez-Garcia, D., & Wolf, M. M. (2015) · Nature · doi:10.1038/nature16059 · Cited by 262
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Metadata
- Authors
- Pour-El, M. B., & Richards, J. I.
- Venue
- Perspectives in Mathematical Logic
- Publisher
- Springer Berlin Heidelberg
- Published
- 1989
- ISSN
- 0172-6641 (ISSN-L)
- OpenAlex
- W1497475168
- Cited by
- 920
- References
- 24
- FWCI
- 2.71
- Type
- book
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computability in Analysis and Physics. https://app.cochat.ai/papers/10.1007/978-3-662-21717-7
- The paper
- Pour-El, M. B., & Richards, J. I. (1989). Computability in Analysis and Physics. Perspectives in Mathematical Logic. https://doi.org/10.1007/978-3-662-21717-7
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.