A Formal Axiomatization of Computation
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 P ≠ NP. In other words, regarding "effective computability" in Brouwer intuitionism viewpoint, we show P ≠ NP.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.