Related papers: Turing Tumble is Turing-Complete
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multi-head Quantum Turing machines with multi final states that also allow tape heads to stay still.
Alternatives to recurrent neural networks, in particular, architectures based on attention or convolutions, have been gaining momentum for processing input sequences. In spite of their relevance, the computational properties of these…
This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable…
We construct recursively-presented finitely-generated torsion groups which have bounded torsion and whose word problem is conjunctive equivalent (in particular positive and Turing equivalent) to a given recursively enumerable set. These…
We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infinite sequence. We show this question is deeply connected to…
We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.
Although polynomial-time probabilistic Turing machines can utilize uncomputable transition probabilities to recognize uncountably many languages with bounded error when allowed to use logarithmic space, it is known that such "magic coins"…
This paper discusses "computational" systems capable of "computing" functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite…
In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward…
Many animals, and an increasing number of artificial agents, display sophisticated capabilities to perceive and manipulate objects. But human beings remain distinctive in their capacity for flexible, creative tool use -- using objects in…
Pebble games are popular models for analyzing time-space trade-offs. In particular, the reversible pebble game is often applied in quantum algorithms like Grover's search to efficiently simulate classical computation on inputs in…
If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are…
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
We present a dynamical toy model for an expanding universe inside a black hole. The model is built by matching a spherically symmetric collapsing matter cloud to an expanding Friedmann-Robertson-Walker universe through a phase transition…
Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations.…
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…
We show the equivalence between a probabilistic Turing machine and the time evolution of a one-dimensional Ising model, the Glauber model in one dimension, equilibrium positions representing the results of computations of the Turing…