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

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…

We define a new quantity we call a ctcbit that provides a means for quantifying a qubit on a closed time-like curve (CTC) as a shared resource. We describe a simple protocol for the sharing of information that is similar to quantum…

A theoretical model of truly autonomic computing systems (ACS), with infinitely many constraints, is proposed. An argument similar to Turing's for the unsolvability of the halting problem, which is permitted in classical logic, shows that…

It is shown here that in a flat, cold dark matter (CDM) dominated Universe with positive cosmological constant ($\Lambda$), modelled in terms of a Newtonian and collisionless fluid, particle trajectories are analytical in time…

We examine closed timelike curves (CTCs) and "effective" superluminal travel in a spacetime containing naked line singularities, which we call "wires". Each wire may be straight-line singularity or a ring singularity. The Weak Energy…

Suspicions that the world might be some sort of a machine or algorithm existing ``in the mind'' of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached…

The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…

Modifying the discrete mechanics proposed by T.D. Lee, we construct a class of discrete classical Hamiltonian systems, in which time is one of the dynamical variables. This includes a toy model of time machines which can travel forward and…

This study aims to provide evidence regarding the emergence of a class of dissipative time crystals when $\mathcal{PT}$ symmetry of the systems is restored in collective spin systems with Lindblad dynamics. First, we show that a standard…

Merging disciplines has led to incredible learnings and breakthroughs throughout history, including the discovery of quantum computing: a cross between computation and quantum physics. In this paper, I will discuss how we can cross quantum…

Turing's (1936) paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure…

Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument against motion, dealing with Zeno squeezed time cycles of computers. The second argument reviews the issue of…

Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading…

Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…

This paper reviews the Church-Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of "hypercomputation", concentrating on perhaps the most straight-forward option: Zeno machines (Turing…

According to the set theory, we prove that objects moving along closed timelike curves (CTCs) should belong to proper classes, but never to any set. Particles in a set have to change own some properties when they come into a CVC in order to…

The physical limits to computation have been under active scrutiny over the past decade or two, as theoretical investigations of the possible impact of quantum mechanical processes on computing have begun to make contact with realizable…

An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…

The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical"…

We prove that any Turing machine running on inputs of arbitrary length can be simulated by a constant bit-size transformer, as long as the context window is sufficiently long. This improves previous works, which require scaling up either…