A Formal Axiomatization of Computation
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 vie...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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}$. |
---|---|
DOI: | 10.48550/arxiv.1907.03533 |