Related papers: Computability Theory of Closed Timelike Curves
The conceptual definition and understanding of time, both quantitatively and qualitatively is of the utmost difficulty and importance. As time is incorporated into the proper structure of the fabric of spacetime, it is interesting to note…
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…
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to the computability of the bandwidth of computable…
We introduce a general categorical framework to reason about quantum theory and other process theories living in spacetimes where Closed Timelike Curves (CTCs) are available, allowing resources to travel back in time and provide…
Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this…
Hypercomputation or super-Turing computation is a ``computation'' that transcends the limit imposed by Turing's model of computability. The field still faces some basic questions, technical (can we mathematically and/or physically build a…
Notoriously, the Einstein equations of general relativity have solutions in which closed timelike curves (CTCs) occur. On these curves time loops back onto itself, which has exotic consequences. However, in order to make time travel stories…
In principe, General Relativity seems to allow the existence of closed timelike curves (CTC). However, when quantum effects are considered, it is likely that their existence is prevented by some kind of chronological protection mechanism,…
In this comment on S.Lloyd, et al, Phys.Rev.Lett. 106, 040403 (2011), we show that modelling closed timelike curves (CTCs) as post-selected teleportation allows signalling to past times before the creation of the CTC and allows information…
Recently Burrage, de Rham, Heisenberg and Tolley have constructed eternal, classical solutions with closed timelike curves (CTCs) in a Galileon model coupled to an auxiliary scalar field. These theories contain at least two distinct metrics…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
We construct a class of closed timelike curves (CTCs) using a compactified extra dimension $u$. A nonzero metric element $g_{tu}(u)$ enables particles to travel backwards in global time $t$. The compactified dimension guarantees that the…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…
Beginning with Turing's seminal work in 1950, artificial intelligence proposes that consciousness can be simulated by a Turing machine. This implies a potential theory of everything where the universe is a simulation on a computer, which…
General relativity predicts the existence of closed timelike curves (CTCs), along which an object could travel to its own past. A consequence of CTCs is the failure of determinism, even for classical systems: one initial condition can…
We present a reduction of the termination problem for a Turing machine (in the simplified form of the Post correspondence problem) to the problem of determining whether a continuous-time Markov chain presented as a set of Kappa…
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…
Inspired by some recent works of Tippett-Tsang and Mallary-Khanna-Price, we present a new spacetime model containing closed timelike curves (CTCs). This model is obtained postulating an ad hoc Lorentzian metric on $\mathbb{R}^4$, which…
The satisfiability problem of the branching time logic CTL is studied in terms of computational complexity. Tight upper and lower bounds are provided for each temporal operator fragment. In parallel, the minimal model size is studied with a…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…