One of the possible hypotheses about time is to consider any instant of time as fuzzy number, so that two instants of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas like Brouwer and Husserl [5]. Throughout this article, the impact of this change on Theory of Computation and Complexity Theory are studied. In order to rebuild Theory of Computation in a more successful and productive approach to solve some major problems in Complexity Theory, the present (...) research is done. This novel theory is called here, the fuzzy time theory of computation, TC^*. (shrink)

In previous article (Computing Fuzzy Time Function) the fuzzy function associated to the instants of time is computed, as it is introduced in Fuzzy Time-Particle interpretation of Quantum Mechanics. Here, we show this computation concludes time is asymmetrical. Also, some other results of the studied paper are discussed.

One of the possible hypotheses about time is to consider any instant of time as a fuzzy number so that two instances of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas. Brouwer and Husserl are two examples. This article studies the impact of this change on the Theory of Computation and Complexity Theory. In order to rebuild the Theory of Computation in a more successful and productive approach to solve some major problems in Complexity Theory, (...) the present research is done. This novel theory is called here, the fuzzy time theory of computation, TC*. Here, we show the situation of some major problems in Complexity theory and Quantum complexity theory in the new model, and how some major problems would be solved. (shrink)

Here we discuss about the following results: 1.

Here, we give the second proof for TC+CON(TC∗)ͰP≠NP . The first proof is in [1]. In the second proof, we do not employ the concept of scope.

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 a finite number of efficiently 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 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 the impact of TC* on TC. -/- . (shrink)

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. (shrink)

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 a finite number of efficiently 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 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. (shrink)

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 a finite number of efficiently 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. (shrink)

This is a presentation about the impacts of Logic and Theory of Computation. It starts by some explanations about Theory of Computation and its relations with the other subjects in science. Then we have some explanations about paradoxes and some historical points. In continuation, we present some of the most important paradoxes. Forthcoming, Five subjects around the relations between Logic and Theory of computation is introduced. Finally, we present a new approach to solve P vs NP problem via Paradoxes (Presentation (...) 6/20/2022 In Persian, Online seminar of The Iranian Association for Logic (IAL) . (shrink)

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. (shrink)

Why Fuzzy time? Why neither "Probabilistic Time" nor "Stochastic time"? In this very short note we argue about.

Here, we try to build the structure of a Theory of computation based on considering time as a fuzzy concept. Actually, there are some reasons to consider time as a fuzzy concept. In this article, we don’t go to this side but we remind that Brower and Husserl ideas about the concept of time were similar [14]. Throughout this article, we present the Theory of Computation with Fuzzy Time. Considering the classical definition of Turing Machine we change and modify the (...) concept of Time to Fuzzy time. We call this new Theory TC* 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 are solved. It should be mentioned that in this article, we consider fuzzy number a symmetric one. The point about the symmetry is in the proof of Lemma 3, although we are able to generalize it. More specifically, we define the new classes of complexity Theory, P*, NP*, BPP* in TC* analogues to the definitions P, NP, BPP as their natural substituted definition. We show P*≠ NP*, P*= BPP*. Finally, we have Theorem 4, P≠NP . (shrink)

In the sequence of articles [1],...,[14], we consider Fuzziness of Time. What about space? Should we consider Fuzzy Space? What would be the Structure of the Physical world? Here we try to shed a light on this subject.

Here, we present some results in continuation of 1.Epistemological Observation About Mind-Machine Equivalence 2.F.Didehvar, Morality, Equality, Mind and Machine, 3.F.Didehvar, on defining “I” On definition of Mind, and Physicalism. -/- .

در تکوین نظریه محاسبات از اوایل قرن بیستم پارادکسها و خود ارجاعی نقش ویژه ای را بازی کرده اند. هر چند نظریه محاسبات عام بر اساس تعریف ماشین تورینگ، فرض تورینگ_چرچ و کاربردهای آن بنا شده ،اما از همان ابتدا تا به امروز منطق و حوزه های مختلف این علم در ارتباط تنگاتنگ با این تیوری و در ابتدا نظریه محاسبات خاص بوده و این ارتباط روز به روز گسترده و گسترده تر گشته است. از تاثیر پارادوکس دروغگو و پارادکس (...) بری در تمایز میان مفهوم محاسبه پذیر و محاسبه پذیر شمارایانه، قضایای گودل و قضیه چیتین همه جا شاهد این تاثیر و تاثر متقابل هستیم. در این مقال می خواهیم بعد از معرفی اجمالی مطالب باال، تاثیر یک پارادوکس دیگر، پارادوکس اعدام غیر منتظره، را بر این نظریه بررسی نماییم. (shrink)