Related papers: Nontrivial Turmites are Turing-universal
This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…
In the manuscript titled "Computation environment (1)", we introduced a notion called computation environment as an interactive model for computation and complexity theory. In this model, Turing machines are not autonomous entities and find…
In this paper, we initiate a study of asymmetric all-or-nothing transforms (or asymmetric AONTs). A (symmetric) $t$-all-or-nothing transform is a bijective mapping defined on the set of $s$-tuples over a specified finite alphabet. It is…
The question of whether significant sub-volumes of a turbulent flow can be identified by automatic means, independently of a-priori assumptions, is addressed using the example of two-dimensional decaying turbulence. Significance is defined…
One of the main problems encountered so far with recurrent neural networks is that they struggle to retain long-time information dependencies in their recurrent connections. Neural Turing Machines (NTMs) attempt to mitigate this issue by…
Transformers are the dominant architecture in AI, yet why they work remains poorly understood. This paper offers a precise answer: a transformer is a Bayesian network. We establish this in five ways. First, we prove that every sigmoid…
An interval translation map (ITM) is a piece-wise translation $T \colon I \to I$ defined on a finite partition $I_1, \ldots, I_r$ of an interval $I$ into $r \ge 2$ subintervals. In contrast to classical interval exchange transformations…
In this work we extend the notion of universal quantum Hamiltonians to the setting of translationally-invariant systems. We present a construction that allows a two-dimensional spin lattice with nearest-neighbour interactions, open…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
The Turing patterning mechanism is believed to underly the formation of repetitive structures in development, such as zebrafish stripes and mammalian digits, but it has proved difficult to isolate the specific biochemical species…
Lindenmayer systems (L-systems) are a formal grammar system that iteratively rewrites all symbols of a string, in parallel. When visualized with a graphical interpretation, the images have self-similar shapes that appear frequently in…
We introduce and investigate forgetting 1-limited automata, which are single-tape Turing machines that, when visiting a cell for the first time, replace the input symbol in it by a fixed symbol, so forgetting the original contents. These…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…
Universal transformers (UTs) have been widely used for complex reasoning tasks such as ARC-AGI and Sudoku, yet the specific sources of their performance gains remain underexplored. In this work, we systematically analyze UTs variants and…
Supervised machine learning provides the learner with a set of input-output examples of the target task. Humans, however, can also learn to perform new tasks from instructions in natural language. Can machines learn to understand…
In this work we propose a generalization of the concept of Ruelle operator for one dimensional lattices used in thermodynamic formalism and ergodic optimization, which we call generalized Ruelle operator, that generalizes both the Ruelle…
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 have defined the Conscious Turing Machine (CTM) for the purpose of investigating a Theoretical Computer Science (TCS) approach to consciousness. For this, we have hewn to the TCS demand for simplicity and understandability. The CTM is…
The attractive feature of the Everett approach is its admirable spirit of approaching the quantum puzzle with a Zen-like "beginner's mind" in order to try to envision what the pure formalism might be saying about quantum reality, even if…
The projective line over the (non-commutative) ring of two-by-two matrices with coefficients in GF(2) is found to fully accommodate the algebra of 15 operators - generalized Pauli matrices - characterizing two-qubit systems. The relevant…