相关论文: Turing Machines Equipped with CTC in Physical Univ…
I argue that Deutsch's model for the behavior of systems traveling around closed timelike curves (CTCs) relies implicitly on a substantive metaphysical assumption. Deutsch is employing a version of quantum theory with a significantly…
There is now a significant body of results on quantum interactions with closed timelike curves (CTCs) in the quantum information literature, for both the Deutsch model of CTC interactions (D-CTCs) and the projective model (P-CTCs). As a…
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…
We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized…
Recently, there has been much interest in the evolution of quantum particles on closed time-like curves (CTCs). However, such models typically assume point-like particles with only two degrees of freedom - a very questionable assumption…
We extend the argument that spacetimes generated by two timelike particles in D=3 gravity (or equivalently by parallel-moving cosmic strings in D=4) permit closed timelike curves (CTC) only at the price of Misner identifications that…
The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and…
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…
We use techniques of quantum information theory to analyze the quantum causal histories approach to quantum gravity. We show that while it is consistent to introduce closed timelike curves (CTCs), they cannot generically carry independent…
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…
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…
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
A computer which has access to a closed timelike curve, and can thereby send the results of calculations into its own past, can exploit this to solve difficult computational problems efficiently. I give a specific demonstration of this for…
Any given prescription of quantum time travel necessarily endows a Hilbert space to the chronology-violating (CV) system on the closed timelike curve (CTC). However, under the two foremost models, Deutsch's prescription (D-CTCs) and…
We present a cyclic symmetric space-time, admitting closed time-like curves (CTCs) which appear after a certain instant of time, i. e., a time-machine space-time. These closed time-like curves evolve from an initial spacelike hypersurface…
Analogue gravity systems offer many insights into gravitational phenomena, both at the classical and at the semiclassical level. The existence of an underlying Minkowskian structure (or Galilean in the non-relativistic limit) in the…
We consider gravity in 2+1 dimensions in presence of extended stationary sources with rotational symmetry. We prove by direct use of Einstein's equations that if i) the energy momentum tensor satisfies the weak energy condition, ii) the…
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not…
Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an inherent causal order between them. Process matrices,…