744 research outputs found
A Computation in a Cellular Automaton Collider Rule 110
A cellular automaton collider is a finite state machine build of rings of
one-dimensional cellular automata. We show how a computation can be performed
on the collider by exploiting interactions between gliders (particles,
localisations). The constructions proposed are based on universality of
elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and
computing on rings.Comment: 39 pages, 32 figures, 3 table
Universalities in cellular automata; a (short) survey
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is organized in three parts: a detailled chronology of seminal papers, a discussion of the definition and main properties of universal cellular automata, and a broad bibliography
Simple networks on complex cellular automata: From de Bruijn diagrams to jump-graphs
We overview networks which characterise dynamics in cellular automata. These
networks are derived from one-dimensional cellular automaton rules and global
states of the automaton evolution: de Bruijn diagrams, subsystem diagrams,
basins of attraction, and jump-graphs. These networks are used to understand
properties of spatially-extended dynamical systems: emergence of non-trivial
patterns, self-organisation, reversibility and chaos. Particular attention is
paid to networks determined by travelling self-localisations, or gliders.Comment: 25 pages, 14 figure
On using compressibility to detect when slime mould completed computation
© 2016 Wiley Periodicals, Inc. Slime mould Physarum polycephalum is a single cell visible by an unaided eye. The slime mould optimizes its network of protoplasmic tubes in gradients of attractants and repellents. This behavior is interpreted as computation. Several prototypes of the slime mould computers were designed to solve problems of computation geometry, graphs, transport networks, and to implement universal computing circuits. Being a living substrate, the slime mould does not halt its behavior when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterizes the pattern's morphological diversity, that is, a number of different local configurations. At the beginning of computation the slime explores the space, thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyze the feasibility of the approach on results of laboratory experiments and computer modelling
Emulation of Narrowband Powerline Data Transmission Channels and Evaluation of PLC Systems
This work proposes advanced emulation of the physical layer behavior of NB-PLC channels and the application of a channel emulator for the evaluation of NB-PLC systems. In addition, test procedures and reference channels are proposed to improve efficiency and accuracy in the system evaluation and classification. This work shows that the channel emulator-based solution opens new ways toward flexible, reliable and technology-independent performance assessment of PLC modems
- …