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

Download Edit this record How to cite View on PhilPapers
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.
Categories
(categorize this paper)
PhilPapers/Archive ID
DIDCPA-3
Revision history
First archival date: 2015-07-31
Latest version: 1 (2015-07-31)
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2015-07-31

Total views
36 ( #33,379 of 39,619 )

Recent downloads (6 months)
8 ( #33,925 of 39,619 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.