Quick read
Physical Irrelevance of Uncountability: Computable Reals Suffice for Continuum Physics
In the paper's words
Continuum physics is formulated over the uncountable real line R, yet every measurement, record, and computation a laboratory can produce is finite. This paper asks whether the uncountability of R — as distinct from its Archimedean completeness — has any physical consequence, and answers that it does not in a precise, checkable sense. The gap addressed is formal: the physics literature treats R as indispensable, while the computability literature has only recently begun to study the computational content of uncountability itself, and no self-contained result connects the two by showing that cardinality is empirically inaccessible.
The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.
Numbers it reports
Second, we derive an observability bound: an instrument of range $L$ and resolution $\delta$ distinguishes at most $N = \lfloor L/\delta \rfloor$ outcomes, so a meter-scale position measurement at $10^{-18}\,\mathrm{m}$ resolution distinguishes $10^{18} \approx 2^{59.79}$ outcomes.
from AbstractAn explicit observability bound: an instrument of range $L$ and resolution $\delta$ has at most $N = \lfloor L/\delta \rfloor$ distinguishable outcomes, computed for concrete instruments, e.g. $N = 10^{18} \approx 2^{59.79}$ outcomes for a meter-scale position measurement at $10^{-18}\,\mathrm{m}$ resolution (Section 4.2).
from 1. IntroductionTake a position measurement with range $L = 1\,\mathrm{m}$ and resolution $\delta = 10^{-18}\,\mathrm{m}$ (a resolution chosen to be far beyond any stated capability in the grounding; it is a deliberately generous bound).
from 4.2 Observability bound: how many outcomes can an experiment have?Whether the $p$-adic "valuation" axis of [10] can be given the same computable treatment; whether constructive (intuitionistic) rather than classical computable reals give a cleaner surrogate; whether the indistinguishability theorem extends to theories with non-computable sets of states (e.g., arbitrary subsets of Hilbert space appearing in axioms) — the theorem covers point-values and record distributions, not arbitrary set-theoretic structure in the model's ontology; and whether chaotic systems with sensitive dependence on initial conditions, where small differences amplify, admit a sharper operational version of the bound of Claim 5.
from 6. DiscussionA laboratory record pipeline with the assumed parameters of Section 4.2 ($b = 24$ bits, $c = 64$ channels, $f = 10^9\,\mathrm{s^{-1}}$, $\tau = 10^3\,\mathrm{s}$) produces at most $2^{1.536 \times 10^{15}}$ distinct records; storing all of them is infeasible, but the bound itself is the point: it is finite, so the record set is countable regardless of storage.
from 7. Practical Implications and Engineering Pathways
How it is done
The approach is threefold.
from AbstractThe cost of this silent choice is not money but conceptual exposure: if uncountability is physically load-bearing, then physical law depends on objects — such as the halting probability $\Omega$ of a universal machine — that no process can compute or measure; if it is not load-bearing, then a large part of the mathematical scaffolding of physics is decoration, and alternative foundations (computable, constructible, or rational-based continua) are empirically equivalent and may be formally cleaner.
from 1. IntroductionThe bibliography available for this paper is heterogeneous; only a minority of its entries bear directly on computability and the continuum, and we use each entry strictly within what its supplied summary states.
from 2. Background and Related WorkThe paper is analytical and constructive.
from 3. Methods
What would falsify it
An assessment of what this does and does not show, including failure modes, falsification conditions, and a concrete next-step calculation (Sections 6 and 7).
from 1. IntroductionThis is precisely the gap our paper sits beside: if the computational content of uncountability is only beginning to be studied on the mathematics side, then the physics-side question of whether uncountability has observable consequences is open by extension.
from 2. Background and Related WorkEntry [10], Depth, Breadth, and Valuation: A Unified Ontology of the Physical Continuum , extends the framework with a third axis, "Valuation," under which $p$-adic completions act as information carriers, and states that the framework yields falsifiable predications for quantum error correction and gauge structure; we adopt its depth/breadth vocabulary but do not rely on its QEC or gauge claims, which the summary states without derivation.
from 2. Background and Related Work
Where the claim stops
The claim is that the difference between the countable computable fragment and the full uncountable continuum is not the kind of difference any experiment can register, because experiments register finite records and finite records cannot encode cardinality.
from 6. DiscussionIf someone produced such a pair, the derivation of Claim 7 must have a gap, and the most likely location is assumption (a) of Section 4.4: the counterexample would have to involve a prediction that is defined over non-computable reals and yet still comparable to data.
from 6. DiscussionThe result rests on the following assumptions, with sensitivity noted for each: Computable derivation of predictions (assumption a).
from 6. Discussion
Where to read
- Abstract245 words · 1 min
- 1. Introduction531 words · 2 min
- 2. Background and Related Work845 words · 4 min
- 3. Methods466 words · 2 min
- 4. Analysis1,394 words · 6 min
- 5. Results319 words · 1 min
- 6. Discussion722 words · 3 min
- 7. Practical Implications and Engineering Pathways847 words · 4 min
- 8. Conclusion336 words · 1 min
- Appendix A. Divergence report182 words · 1 min
- Appendix B. Claim attribution315 words · 1 min
- Provenance and AI Involvement197 words · 1 min
Read from the paper itself: 18 sections, 6,542 words. Nothing on this page is written by a model; a line that is not a sentence of the paper is not shown. Have a specific question? Ask this paper.