P≠NP

Abstract

Here, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept. In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3]. Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable. In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4.

Author's Profile

Farzad Didehvar
Amir Kabir University University (Tehran Polytechnic)

Analytics

Added to PP
2021-06-22

Downloads
172 (#73,179)

6 months
46 (#80,006)

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?