2 citations · 5 across the 17 of their papers we have counts for
17 papers
Well-Defined but Not Predetermined Persistent Mathematical Objects, Embedded Observers, and the Provability of P = N P
Rasoul Ramezanian
We develop a foundational distinction between \emph{well-definedness} and \emph{predetermination}. A persistent mathematical or computational object may return a unique answer when…
Stable Matching with Payoff Guarantees
Mohsen Pourpouneh, Rasoul Ramezanian, Arunava Sen +1
We consider a variant of the Assignment Game of Shapley and Shubik (1971), where agents do not observe the assignment or the surplus division of other matched pairs. We propose a s…
The Division Problem of Chances
Rasoul Ramezanian
In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may hav…
The Temporal Continuum
Mohammad Ardeshir, Rasoul Ramezanian
The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a li…
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…
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…