Authors
Abstract
Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy)
Keywords Unexpected Hanging Paradox  Liar Paradox  Turing machine  P=NP   P=PSAPCE  Consistency & Axiomatizability
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Two Dogmas of Empiricism.W. Quine - 1951 - [Longmans, Green].
On Denoting.Bertrand Russell - 1905 - Mind 14 (56):479-493.
Outline of a Theory of Truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Reference and Definite Descriptions.Keith S. Donnellan - 1966 - Philosophical Review 75 (3):281-304.
On Denoting.Bertrand Russell - 2005 - Mind 114 (456):873 - 887.

View all 266 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Transcending Turing Computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Computation in Cognitive Science: It is Not All About Turing-Equivalent Computation.Kenneth Aizawa - 2010 - Studies in History and Philosophy of Science Part A 41 (3):227-236.

Analytics

Added to PP index
2019-04-14

Total views
151 ( #61,295 of 2,381,244 )

Recent downloads (6 months)
41 ( #17,970 of 2,381,244 )

How can I increase my downloads?

Downloads

My notes