Lower Bound on the Computation Needed to Simulate a Bounce Patch Exactly
Year: 2026
Type: article
Abstract: This paper examines what it would cost, at minimum, to simulate a bounce patch exactly rather than approximately. The calculation is performed in a frame with a finite maximum density, the neutron-branch value rho_A = 9.718e+57 kg per cubic metre, with the electron branch at 2.874e+51 kg per cubic metre for comparison. Headline results include a bounce temperature of 3.278e+22 K, a Landauer cost at that temperature of 3.137e-01 J per bit against 2.871e-21 J per bit at 300 K, a Bekenstein allowance of 1.049e+94 bits for the stated centimetre reference region, and a Margolus-Levitin rate of 2.209e+103 per second for the same region. The logarithm of the dimension for the reference patch is of order 1e94 in base ten, placing exact simulation beyond any finite machine that obeys the same bounds. All numbers are computed from the stated assumptions in the accompanying script; the study is simulated and computed, not measured.
Author: Aldred, William Alexander
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225775695
FWCI:
Cites:
Cited by:
Related to: