相关论文: Turing Machines Equipped with CTC in Physical Univ…

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

A polynomial Turing compression (PTC) for a parameterized problem $L$ is a polynomial time Turing machine that has access to an oracle for a problem $L'$ such that a polynomial in the input parameter bounds each query. Meanwhile, a…

Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite ($*$-finite) number of bits while keeping the finite…

It is known for a long time that the space time around a spinning cylindrical symmetric compact object such as the cosmic string, show un-physical behavior, i.e., they would possess closed time like curves (CTC). This controversy with…

We study the massless scalar field on asymptotically flat spacetimes with closed timelike curves (CTC's), in which all future-directed CTC's traverse one end of a handle (wormhole) and emerge from the other end at an earlier time. For a…

Turing Machines are universal computing machines in theory. It has been a long debate whether Turing Machines can simulate the consciousness mind behaviors in the materialistic universe. Three different hypotheses come out of such debate,…

We study the power of closed timelike curves (CTCs) and other nonlinear extensions of quantum mechanics for distinguishing nonorthogonal states and speeding up hard computations. If a CTC-assisted computer is presented with a labeled…

Closed Timelike Curves (CTCs) are intriguing relativistic objects that allow for time travel to the past and can be used as computational resources. In Deutschian Closed Timelike Curves (D-CTCs), due to the monogamy of entanglement,…

Because no closed timelike curve (CTC) on a Lorentzian manifold can be deformed to a point, any such manifold containing a CTC must have a topological feature, to be called a timelike wormhole, that prevents the CTC from being deformed to a…

Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…

Many solutions of Einstein's field equations contain closed timelike curves (CTC). Some of these solutions refer to ordinary materials in situations which might occur in the laboratory, or in astrophysics. It is argued that, in default of a…

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…

The invention of CPU-centric computing paradigm was incredible breakthrough of computer science that revolutionized our everyday life dramatically. However, the CPU- centric paradigm is based on the Turing machine concept and, as a result,…

There has been considerable recent interest in the consequences of closed timelike curves (CTCs) for the dynamics of quantum mechanical systems. A vast majority of research into this area makes use of the dynamical equations developed by…

Our main models of computation (the Turing Machine and the RAM) make fundamental assumptions about which primitive operations are realizable. The consensus is that these include logical operations like conjunction, disjunction and negation,…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Bennett and Schumacher's postselected quantum teleportation is a model of closed timelike curves (CTCs) that leads to results physically different from Deutsch's model. We show that even a single qubit passing through a postselected CTC…

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity…

In the first of this pair of papers, it was proven that that no physical computer can correctly carry out all computational tasks that can be posed to it. The generality of this result follows from its use of a novel definition of…