Computer-Simulation Model Theory is introduced to conclude that P=NP is not provable by constructing an indistinguishable simulation where P does not equal NP.
Then in definition 7.4, we slightly change the UC of V and construct a computer-simulation model named E which its UC persistently evolves
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computer-Simulation Model Theory (P= NP is not provable)
Computer-Simulation Model Theory is introduced to conclude that P=NP is not provable by constructing an indistinguishable simulation where P does not equal NP.