Experiments, Computability, and the Existence of Physical Functions
Isaac P\'erez Castillo

TL;DR
This paper demonstrates that experimental procedures can be modeled as algorithms producing physical functions, clarifying the relationship between experiment, computability, and measurement accuracy.
Contribution
It introduces a formal framework linking experimental science with computability theory, clarifying the existence and computability of physical functions under finite-precision measurements.
Findings
Experimental procedures can be viewed as algorithms producing physical functions.
Finite-precision measurements are compatible with the existence of these functions.
Protocol dependence and stochasticity specify the realized map and assumptions needed for protocol-independent quantities.
Abstract
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the protocol, background conditions, and reporting rules are fixed. Assuming an explicit physical Church--Turing bridge principle, a reproducible experiment therefore computes a map from admissible inputs to outputs, and the corresponding function exists in the sense appropriate to those outputs. Furthermore, computable analysis allows us to explain why this conclusion is compatible with finite-precision measurement since in this case what matters is a systematic approximation to a requested accuracy, not the production of exact real numbers in a single step. Neither protocol dependence nor stochasticity undermines the existence claim. Rather, they specify which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
