A Formal Axiomatization of Computation
Computational Complexity
2020-01-22 v2 Computation and Language
Logic in Computer Science
Abstract
We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by , which satisfies our axioms and . In other words, regarding "effective computability" in Brouwer intuitionism viewpoint, we show .
Cite
@article{arxiv.1907.03533,
title = {A Formal Axiomatization of Computation},
author = {Rasoul Ramezanian},
journal= {arXiv preprint arXiv:1907.03533},
year = {2020}
}
Comments
13 page. arXiv admin note: substantial text overlap with arXiv:1906.09873, arXiv:1205.5994