Related papers: Turing Machines Equipped with CTC in Physical Univ…
Understanding the relationship between the time-symmetric nature of physical laws and the apparent directionality of causality is a central question in quantum foundations. The standard operational formulation, widely used in quantum…
Closed Time-like curves (CTC) in Cosmic strings in teleparallel $T_{4}$ gravity are forbidden.This result shown here in $T_{4}$ was shown by Soleng (Phys.Rev.D49 (1994)1124) also to be valid in Einstein-Cartan (EC) gravity.Here we show that…
In asymmetrically warped spacetimes different warp factors are assigned to space and to time. We discuss causality properties of these warped brane universes and argue that scenarios with two extra dimensions may allow for timelike curves…
Metastability is a spurious mode of operation in digital signals, where an electrical signal fails to settle into a stable state within a specified time, leading to uncertainty and potentially failing downstream hardware. A system that…
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard…
For time travel to be consistent with the known laws of physics, the resulting paradoxes must be resolved. It has been suggested that parallel timelines (a.k.a. multiple histories) may provide a resolution. However, so far, a concrete…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
A discrete time crystal (DTC) repeats itself with a rigid rhythm, mimicking a ticking clock set by the interplay between its internal structures and an external force. DTCs promise profound applications in precision time-keeping and other…
Expanding upon the widely recognized notion of mathematical universality in Turing machines, a concept of thermodynamic universality in Turing machines is introduced. Under the physical Church-Turing thesis, the existence of a…
The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially,…
We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
We show that it is possible to clone quantum states to arbitrary accuracy in the presence of a Deutschian closed timelike curve (D-CTC), with a fidelity converging to one in the limit as the dimension of the CTC system becomes large---thus…
In arXiv:1107.4675 Ralph uses our post-selection model of closed timelike curves (P-CTC) to construct an "unproven-theorem" paradox, and claims that this voids our argument that P-CTCs are able to resolve such types of paradoxes. Here we…
A condition proposed by David Deutsch to describe analogues of processes in the presence of closed timelike curves (D-CTC condition) in bipartite quantum systems is investigated within the framework of local relativistic quantum field…
The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. We examine consciousness from the perspective of theoretical computer science (TCS), a branch of…
Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis. We draw a clear line as to…
Classical computability theory tells us that self-modifying code (SMC) on a deterministic universal Turing machine can be simulated by non-SMC code on the same model. That abstraction, however, omits the external timing inputs, concurrency,…
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…