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.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2015-07-31

Downloads
210 (#99,472)

6 months
52 (#90,926)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Farzad Didehvar
Amir Kabir University University (Tehran Polytechnic)

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references