Theory of Fuzzy Time Computation (2, P vs NP problem)

Abstract

Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world of computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P ≠ NP and P* ≠ NP*. Throughout this article, we discuss around the impact of TC* on TC.

Author's Profile

Analytics

Added to PP
2023-02-12

Downloads
65 (#89,576)

6 months
26 (#90,496)

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?