• Corpus ID: 195345329

Computer-Simulation Model Theory (P= NP is not provable)

@article{Ramezanian2019ComputerSimulationMT,
  title={Computer-Simulation Model Theory (P= NP is not provable)},
  author={Rasoul Ramezanian},
  journal={ArXiv},
  year={2019},
  volume={abs/1906.09873}
}
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 is a computer simulation program like a video game. All works we do (talking, reasoning, seeing and etc) are computations performed by the universe-computer which runs the simulation program. Inspired by the view of the simulation hypothesis (but independent of this hypothesis), we propose a new method of logical… 

References

SHOWING 1-2 OF 2 REFERENCES
Automata and languages - theory and applications
TLDR
This book discusses models for Context-Free Languages, properties of Regular Languages, and generalized models for Regular Languages.
Computational Complexity: A Modern Approach
TLDR
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.