Synchronizing a virtual cellular automaton collider

被引:1
|
作者
Barrientos, Oswaldo L. [1 ]
Martinez, Genaro J. [1 ,2 ]
Adamatzky, Andrew [2 ]
Ninagawa, Shigeru [3 ]
机构
[1] Escuela Super Computo, Inst Politecn Nacl, Comp Sci Lab, Mexico City, DF, Mexico
[2] Univ West England, Unconvent Comp Lab, Bristol, Avon, England
[3] Kanazawa Inst Technol, Haku San, Japan
关键词
cellular automata; rule; 110; cyclic tag system; virtual collider; unconventional computing;
D O I
10.1109/CANDAR57322.2022.00009
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cellular automata have been a topic of great interest in unconventional computation theory for its architecture: simple but capable of producing complex structures with a dynamic behavior and massive parallel computation. Collision-based computing with multiple reactions is a way to explore such capacities. Following this logic, a virtual collider was proposed as a way to develop computers by using the elementary cellular automaton rule 110. The main result in this paper is the computational implementation of the virtual collider, capable of supporting the execution of three simultaneous cyclotrons. The lateral cyclotrons handle particles which are injected to the main collider to perform a computation. Particles move until they reach a contact point, where they trigger a series of chained reactions among hundreds of thousands of cells. Using this program, we present a configuration of the collider that simulates the execution of the first nine transitions of a cyclic tag system using rule 110 particles, the largest simulation of this kind to date.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 50 条
  • [31] On the synchronizing mechanism of a class of cellular automata
    Satulovsky, JE
    PHYSICA A, 1997, 237 (1-2): : 52 - 58
  • [32] A Cellular Automaton for Blocking Queen Games
    Cook, Matthew
    Larsson, Urban
    Neary, Turlough
    CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015, 2015, 9099 : 71 - 84
  • [33] GARDEN OF EDEN IN CELLULAR CONWAY AUTOMATON
    HARDOUINDUPARC, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1974, 8 (NR3): : 63 - 71
  • [34] A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID
    Margenstern, Maurice
    Song, Yu
    PARALLEL PROCESSING LETTERS, 2009, 19 (02) : 227 - 246
  • [35] On the hierarchy of conservation laws in a cellular automaton
    Enrico Formenti
    Jarkko Kari
    Siamak Taati
    Natural Computing, 2011, 10 : 1275 - 1294
  • [36] Exact solution of a cellular automaton for traffic
    Evans, MR
    Rajewsky, N
    Speer, ER
    JOURNAL OF STATISTICAL PHYSICS, 1999, 95 (1-2) : 45 - 96
  • [37] EFFICIENT UNIDIMENSIONAL UNIVERSAL CELLULAR AUTOMATON
    MARTIN, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 374 - 382
  • [38] An isotropic cellular automaton for excitable media
    Nishiyama, A.
    Tanaka, H.
    Tokihiro, T.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2008, 387 (13) : 3129 - 3136
  • [39] Sofic trace subshift of a cellular automaton
    Cervelle, Julien
    Formenti, Enrico
    Guillon, Pierre
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 152 - +
  • [40] Demonstration of the universality of a new cellular automaton
    Sapin, E.
    Bailleux, O.
    Chabrier, J. -J.
    Collet, P.
    INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2007, 3 (02) : 79 - 103