Operational Evidence and Incompleteness: A Minkowski Radar Model

In the vast landscape of science, there is a fundamental tension between what we can measure and what we can know. We often assume that if a question has a definite answer, a sufficiently clever experiment or a powerful enough theory will eventually reveal it. This belief underpins much of our confidence in physics and mathematics: that the universe is orderly and that our tools for understanding it are, in principle, capable of settling any dispute. However, a specific branch of mathematics known as computability theory has long shown that this confidence has a hard limit. It proves that there are certain questions about whether a computer program will ever finish its work that no single, consistent set of rules can answer for every possible case. These are not questions of missing data or insufficient technology; they are structural gaps in what can be logically proven. The question that has lingered is whether this abstract mathematical limitation has any real-world counterpart, or if it remains a curiosity confined to the realm of pure logic.

A new paper by Milan Rosko brings this abstract limitation into the physical world of radar and timekeeping. The work does not propose a new machine or a new law of physics, but rather constructs a thought experiment that acts as a bridge between the physical act of measuring distance and the logical problem of predicting a computer's behavior. Rosko imagines a scenario involving a single observer and a stationary mirror, or reflector, placed at a specific distance. The observer sends out a pulse of light, which bounces off the mirror and returns. By measuring the time it takes for the pulse to make the round trip, the observer can calculate the distance to the mirror with extreme precision. The setup is simple and relies on the standard understanding that the speed of light is constant. The innovation lies not in the physics of the measurement, but in how the distance to the mirror is defined. In this model, the distance is not a fixed, known number like ten meters. Instead, the distance is tied to the behavior of a specific computer program. If the program eventually stops running, the distance is one specific value; if the program runs forever, the distance is a slightly different value.

The core of the discovery is that while any single measurement of this distance can be completed in a finite amount of time, the ability to know the true nature of the distance is fundamentally blocked. The researcher shows that for any specific level of precision, the observer can perform a measurement that terminates and produces a result. If the computer program halts, the measurement will eventually reveal that the distance falls within a certain narrow range. If the program never halts, the measurement will show that the enclosure contains the value 1, causing the verification check to fail. This means that the existence of a successful measurement record is something that can be verified. However, the paper demonstrates that no consistent theory of physics or logic can ever prove that a specific verifying record does not exist if that distance corresponds to a program that never halts. In other words, there are true statements about the absence of a verifying record that a sound theory can never prove.

This result is a direct translation of a famous mathematical problem into the language of radar. The paper proves that the set of questions about whether a distance falls within a certain bound is as difficult to solve as the problem of predicting whether a computer program will stop. Just as there is no general algorithm that can look at any program and say with certainty whether it will halt, there is no single theory that can look at any distance defined in this way and say with certainty whether a verifying measurement exists. The paper establishes that while every individual measurement procedure works and finishes, the collection of all possible "absence" statements—claims that no measurement will ever succeed—remains largely undecided. There are infinitely many true statements of this kind that a theory can neither prove nor disprove.

The significance of this work lies in its clarity. It does not rely on complex quantum effects or the curvature of space-time. It uses the most basic tools of observation: a clock, a light pulse, and a mirror. By showing that the limits of logical proof appear even in such a simple, classical setup, the paper suggests that the incompleteness found in mathematics is not just an artifact of abstract symbols. It is a feature that can be realized in a physical model of measurement. The author is careful to note that this is a theoretical construction. The paper does not claim that we can physically build a mirror at a distance that depends on a specific computer program in a way that allows us to test this in a laboratory. The focus is on the logical structure of the model itself. It shows that if we accept the standard rules of how computers work and how measurements are recorded, we must accept that there are limits to what can be certified.

Ultimately, the paper offers a quiet but firm correction to the idea that a finite measurement record can always certify a claim about the physical world. It shows that while we can always finish a measurement, we cannot always know if the result we are looking for is impossible to find. There are true facts about the world—specifically, facts about the non-existence of a verifying record—that remain forever beyond the reach of any consistent theory. This is not a failure of our instruments or our intelligence, but a fundamental boundary. The work confirms that the gap between what can be computed and what can be known is not just a mathematical curiosity, but a structural reality that can be mapped onto the simplest of physical interactions. The radar model serves as a clear, concrete illustration of a standard obstruction in computation, proving that the inability to decide certain questions is as real as the light pulse traveling to the mirror and back.