Consistency Problem and “Unexpected Hanging Paradox” (An answering to P=NP Problem)

Abstract

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.

Author's Profile

Farzad Didehvar
Amir Kabir University University (Tehran Polytechnic)

Analytics

Added to PP
2015-07-31

Downloads
173 (#67,976)

6 months
38 (#83,605)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?