55 research outputs found
A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
In this paper we investigate certain properties of semi-totalistic cellular
automata (CA) on the well known quasi-periodic kite and dart two dimensional
tiling of the plane presented by Roger Penrose. We show that, despite the
irregularity of the underlying grid, it is possible to devise a semi-totalistic
CA capable of simulating any boolean circuit on this aperiodic tiling.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249
Reversible Logic Elements with Memory and Their Universality
Reversible computing is a paradigm of computation that reflects physical
reversibility, one of the fundamental microscopic laws of Nature. In this
survey, we discuss topics on reversible logic elements with memory (RLEM),
which can be used to build reversible computing systems, and their
universality. An RLEM is called universal, if any reversible sequential machine
(RSM) can be realized as a circuit composed only of it. Since a finite-state
control and a tape cell of a reversible Turing machine (RTM) are formalized as
RSMs, any RTM can be constructed from a universal RLEM. Here, we investigate
2-state RLEMs, and show that infinitely many kinds of non-degenerate RLEMs are
all universal besides only four exceptions. Non-universality of these
exceptional RLEMs is also argued.Comment: In Proceedings MCU 2013, arXiv:1309.104
Proceedings of AUTOMATA 2010: 16th International workshop on cellular automata and discrete complex systems
International audienceThese local proceedings hold the papers of two catgeories: (a) Short, non-reviewed papers (b) Full paper
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Using MapReduce Streaming for Distributed Life Simulation on the Cloud
Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp
- …