Related papers: Turing Tumble is Turing-Complete
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that…
In the present paper, we construct what we call a pedagogical universal Turing machine. We try to understand which comparisons with biological phenomena can be deduced from its encoding and from its working.
We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by attentional processes. The combined system is analogous to a Turing Machine or Von Neumann architecture but is…
The notion of Reactive Turing machine (RTM) was proposed as an orthogonal extension of Turing machines with interaction. RTMs are used to define the notion of executable transition system in the same way as Turing machines are used to…
Does combining a finite collection of objects infinitely many times guarantee the construction of a particular object? Here we use recursive function theory to examine the popular scenario of an infinite collection of typing monkeys…
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
Length generalization refers to the ability to extrapolate from short training sequences to long test sequences and is a challenge for current large language models. While prior work has proposed some architecture or data format changes to…
A variant of Turing machines is introduced where the tape is replaced by a single tree which can be manipulated in a style akin to purely functional programming. This yields two benefits: first, the extra structure on the tape can be…
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…
We revisit the question (most famously) initiated by Turing: can human intelligence be completely modeled by a Turing machine? We show that the answer is \emph{no}, assuming a certain weak soundness hypothesis. More specifically we show…
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…
We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…
The Universal Turing Machine (TM) is a model for VonNeumann computers --- general-purpose computers. A human brain can inside-skull-automatically learn a universal TM so that he acts as a general-purpose computer and writes a computer…
Not only did Turing help found one of the most exciting areas of modern science (computer science), but it may be that his contribution to our understanding of our physical reality is greater than we had hitherto supposed. Here I explore…
According to Deutsch, a universal quantum Turing machine (UQTM) is able to perform, in repeating a fixed unitary transformation on the total system, an arbitrary unitary transformation on an arbitrary data state, by including a program as…
We prove that a finite dimensional algebra $\Lambda$ is $\tau-$tilting finite if and only if all the bricks over $\Lambda$ are finitely generated. This is obtained as a consequence of the existence of proper locally maximal torsion classes…