A Synthetic Informational Proof of Goldbach's Conjecture
Authors/Creators
Description
This paper presents a novel, information-theoretic reformulation of Goldbach’s Conjecture within a synthetic universe modeled as a causal graph. By defining a canonical bijection between natural numbers and graph structures, and introducing algebraic operations that mirror addition and multiplication, the work establishes a rigorous isomorphism between arithmetic and informational graph algebra. Primality is reinterpreted as graph irreducibility, leading to a synthetic version of Goldbach’s Conjecture. While the conjecture remains unproven, this framework offers strong structural, logical, and physical motivation grounded in entropy-driven graph dynamics.