-
Interacting Strings of Characters
Projet MEVAL -
Halting Problem for One-State Turing Machines
In [1], Turing has established the well-known result of the indecidability of the general halting problem of Turing machines. It is also well known that there exists... -
Computability of the entropy of one-tape Turing Machines
First version -
The expressive power of analog recurrent neural networks on infinite input st...
International audience -
Universality in two dimensions
International audience -
A Small Minimal Aperiodic Reversible Turing Machine
International audience
