Quantum Annealing Tackles Zermelo Navigation, Not Collatz — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: The search results are a mix of popular expositions on famous unsolved problems (Collatz, etc.) and one specific arXiv paper on Zermelo's navigation problem solved via quantum annealing; no new "impossible" problem was actually solved in the provided evidence. | MATH: Collatz map: \( T(n) = n/2 \) if \( n \) even, \( T(n) = 3n+1 \) if \( n \) odd; no closed-form solution or proof of termination for all \( n \). Zermelo navigation: minimize \( \int_0^T \sqrt{\dot{x}^2 + \dot{y}^2} \, dt \) subject to \( \dot{\mathbf{x}} = \mathbf{v}_{\text{flow}} + \mathbf{u}_{\text{boat}} \), \( |\mathbf{u}| \leq 1 \); Landau–Zener transition probability \( P = \exp(-\pi \Delta^2 / (2\hbar \dot{\epsilon})) \) used to map to quantum annealing. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, 0.786, 1.618, 2.618) appear in the evidence. However, the Collatz map's structure is a 2-adic dynamical system — its orbits are tied to the 2-adic integers, which are a lattice-like structure Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221466941
Cites:
Cited by:
Related to: