2 citations · 5 across the 17 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2019
A Formal Axiomatization of Computation
Rasoul Ramezanian
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 $E…
cs.CC2019
Computer-Simulation Model Theory (P= NP is not provable)
Rasoul Ramezanian
The simulation hypothesis says that all the materials and events in the reality (including the universe, our body, our thinking, walking and etc) are computations, and the reality…
cs.CC2012
Computation Environments, An Interactive Semantics for Turing Machines (which P is not equal to NP considering it)
Rasoul Ramezanian
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}.…