Finite Possibility Mechanics Modular Series: Papers, Reference Simulator, and Reproduction Map

Finite Possibility Mechanics (FPM) is a finite-resource mechanics of directed alternatives, formulated on a finite periodic cubic lattice. Each site carries bounded energy, a directed 3x3 route-cost ledger, a normalized nine-channel complex carrier, and local auxiliary state. Ordinary per-tick action is redistributed through a nearest-neighbour reversible Markov kernel and recorded in a signed ledger, yielding exact finite-graph results for local and global conservation, nodewise and regional continuity, finite propagation, equilibrium transport, and finite work capacity. The modular series separates this programme into six independently citable layers: foundations; executable reference semantics; carrier and information dynamics; a deterministic exact-integer sandbox; phenomenological bridges to quantum, thermodynamic, gravitational, cosmological, and electromagnetic observables; and an empirical audit and falsification protocol. A public Python simulator and machine-readable output reproduce the computational checks associated with Papers 01, 02, and 04. The formal and computational results establish properties of the stated model; bridge correspondences, calibrations, and retrospective comparisons are hypotheses and audits rather than independent evidence of physical validity. The series therefore presents both a reproducible construction and explicit empirical failure conditions.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-18
DOI
https://doi.org/10.5281/zenodo.21420797
Primary Topic
Quantum many-body systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finite Possibility Mechanics Modular Series: Papers, Reference Simulator, and Reproduction Map

Alx Spiker
Zenodo (CERN European Organization for Nuclear Research)
Quantum many-body systems
article

Finite Possibility Mechanics Modular Series: Papers, Reference Simulator, and Reproduction Map

Alx Spiker
article en

Abstract

Finite Possibility Mechanics (FPM) is a finite-resource mechanics of directed alternatives, formulated on a finite periodic cubic lattice. Each site carries bounded energy, a directed 3x3 route-cost ledger, a normalized nine-channel complex carrier, and local auxiliary state. Ordinary per-tick action is redistributed through a nearest-neighbour reversible Markov kernel and recorded in a signed ledger, yielding exact finite-graph results for local and global conservation, nodewise and regional continuity, finite propagation, equilibrium transport, and finite work capacity. The modular series separates this programme into six independently citable layers: foundations; executable reference semantics; carrier and information dynamics; a deterministic exact-integer sandbox; phenomenological bridges to quantum, thermodynamic, gravitational, cosmological, and electromagnetic observables; and an empirical audit and falsification protocol. A public Python simulator and machine-readable output reproduce the computational checks associated with Papers 01, 02, and 04. The formal and computational results establish properties of the stated model; bridge correspondences, calibrations, and retrospective comparisons are hypotheses and audits rather than independent evidence of physical validity. The series therefore presents both a reproducible construction and explicit empirical failure conditions.

Zenodo (CERN European Organization for Nuclear Research)
Life in Land
Openalex Percentile: Top 9%
Quantum many-body systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.