Algebra Before Bit: A Computer Scientist's Account of a Finite Record Universe

Abstract

Imagine inspecting a quantum experiment through a programmer's console: what must be stored, what changes when a detector is read, and what can its records tell us? This is a representation, not a hypothesis: nothing here says the universe is a simulation, and nothing here depends on it being one. We examine a proposed physical model built from interacting groups of quantum bits and rules for producing readable measurement records; this is the finite record framework discussed here. The physicist John Archibald Wheeler's phrase "it from bit" asked whether physical reality could be understood through recorded answers to questions. Our systems description asks what structures and operations must exist before such an answer can be produced. Beginning with plain-language explanations of qubits, superposition and entanglement, the paper connects quantum states to data structures, interactions to typed rules, and measurement to state changes and record writes. A small executable example makes these connections tangible. It also exposes the practical research questions: how much memory is required, what repeated use retains, and which physical rules still have to be supplied. Version 0.3. An accessible systems account for readers with an undergraduate mathematical background. Includes a quantum primer, six main diagrams, two appendices, a worked structured-analysis specification, and an executable Bell-pair example. The accompanying archive contains the LaTeX sources, bibliography, Python examples, verification scripts, source bindings and reference checks. The examples distinguish standard quantum calculations from the open physical inputs of the proposed finite record model. They do not constitute a complete universe simulator. The source package supports 441 portable paper checks and 2,372 systems checks over 180 supported outcome branches; authentication against the frozen repository sources raises the paper-check count to 503.