An Intrinsically Universal Family of Signal Machines

by   Florent Becker, et al.

Signal machines form an abstract and perfect model of collision computing as well as particle/signal/soliton dynamics in cellular automata based on dimensionless signals on a line. Each signal move at constant speed (according to its nature). When signals meet they get replaced by other signals. A signal machine defines the kind of signals available, their speeds and the rules for replacement. Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal (ray of parallel signals inside a support zone). Each macro-signal has a main signal located exactly where the simulated signal would be and encodes its id and the rules of the simulated machine. The simulation of a collision (macro-collision) consists of two phases. In the first phase, macro-signals are shrunk-to get some delay-then involved macro-signals are identified and it is ensured that no other macro-signal is too close. If not, the process is aborted and the relative distance between shrunk macro-signals was enlarge so that the correct macro-collision will eventually be initiated. Otherwise, the second phase starts: the appropriate rule is found and new macro-signals are generated accordingly. Varying the set of speeds generates an intrinsically universal family of signal machines.



There are no comments yet.


page 1

page 2

page 3

page 4


An algorithm to simulate alternating Turing machine in signal machine

Geometrical Computation as a new model of computation is the counterpart...

Abstract Geometrical Computation 11: Slanted Firing Squad Synchronisation on Signal Machines

Firing Squad Synchronisation on Cellular Automata is the dynamical synch...

Approximating Optimal Bidirectional Macro Schemes

Lempel-Ziv is an easy-to-compute member of a wide family of so-called ma...

Malleable scheduling beyond identical machines

In malleable job scheduling, jobs can be executed simultaneously on mult...

Classification of simulated radio signals using Wide Residual Networks for use in the search for extra-terrestrial intelligence

We describe a new approach and algorithm for the detection of artificial...

Conservative DG Method for the Micro-Macro Decomposition of the Vlasov-Poisson-Lenard-Bernstein Model

The micro-macro (mM) decomposition approach is considered for the numeri...

Super Learning in the SAS system

Background and objective: Stacking is an ensemble machine learning metho...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.