2000 character limit reached
A Formal Axiomatization of Computation (1907.03533v2)
Published 4 Jul 2019 in cs.CC, cs.CL, and cs.LO
Abstract: We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by $E$, which satisfies our axioms and $E \models \mathrm{ P \neq NP}$. In other words, regarding "effective computability" in Brouwer intuitionism viewpoint, we show $\mathrm{ P \neq NP}$.