相关论文: Turing Machines Equipped with CTC in Physical Univ…
In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof…
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. While this thesis is crucial for our understanding of…
The simulation hypothesis has recently excited renewed interest in the physics and philosophy communities. However, the hypothesis specifically concerns {\textit{computers}} that simulate physical universes. So to formally investigate the…
Recently, Ai, Cruz, Garbrecht, and Tamarit (arXiv:2001.07152, arXiv:2404.16026, arXiv:2511.04216) claimed that the strong CP problem can be avoided by adopting a particular order of limits in the Euclidean path integral, in which the…
Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…
At first glance, it seems possible to construct in general relativity theory causality violating solutions. The most striking one is the Gott spacetime. Two cosmic strings, approaching each other with high velocity, could produce closed…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
General relativity allows solutions exhibiting closed timelike curves. Time travel generates paradoxes and quantum mechanics generalizations were proposed to solve those paradoxes. The implications of self-consistent interactions on acausal…
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…
A new variational technique determines the general condition of equilibrium of a rotating gravito-electromagnetic system and provides a modified dynamical equation of motion from where it emerges a so-far unforseen topological torsion…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly-powerful classical computing model, called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with an ensemble…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability,…
Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In…
We study the weak call-by-value $\lambda$-calculus as a model for computational complexity theory and establish the natural measures for time and space -- the number of beta-reductions and the size of the largest term in a computation -- as…
The spacetime metric around a rotating SuperConductive Ring (SCR) is deduced from the gravitomagnetic London moment in rotating superconductors. It is shown that theoretically it is possible to generate Closed Timelike Curves (CTC) with…
Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, then a Turing Machine should be able to simulate the human mind. In this paper, I challenge that assumption by providing strong mathematical…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
Closed timelike curves are among the most controversial features of modern physics. As legitimate solutions to Einstein's field equations, they allow for time travel, which instinctively seems paradoxical. However, in the quantum regime…