1,163 research outputs found

    A Full Computation-relevant Topological Dynamics Classification of Elementary Cellular Automata

    Full text link
    Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos"

    Designing complex dynamics in cellular automata with memory

    Get PDF
    Since their inception at Macy conferences in later 1940s, complex systems have remained the most controversial topic of interdisciplinary sciences. The term "complex system" is the most vague and liberally used scientific term. Using elementary cellular automata (ECA), and exploiting the CA classification, we demonstrate elusiveness of "complexity" by shifting space-time dynamics of the automata from simple to complex by enriching cells with memory. This way, we can transform any ECA class to another ECA class - without changing skeleton of cell-state transition function - and vice versa by just selecting a right kind of memory. A systematic analysis displays that memory helps "discover" hidden information and behavior on trivial - uniform, periodic, and nontrivial - chaotic, complex - dynamical systems. © World Scientific Publishing Company

    Remarks on permutive cellular automata

    Get PDF
    AbstractWe prove that every two-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states

    Classifying 1D elementary cellular automata with the 0-1 test for chaos

    Get PDF
    We utilise the 0-1 test to automatically classify elementary cellular automata. The quantitative results of the 0-1 test reveal a number of advantages over Wolfram’s qualitative classification. For instance, while almost all rules classified as chaotic by Wolfram were confirmed as such by the 0-1 test, there were two rules which were revealed to be non-chaotic. However, their periodic nature is hidden by the high complexity of their spacetime patterns and not easy to see without looking very carefully. Comparing each rule’s chaoticity (as quantified by the 0-1 test) against its intrinsic complexity (as quantified by its Chua complexity index) also reveals a number of counter-intuitive discoveries; i.e. non-chaotic dynamics are not only found in simpler rules, but also in rules as complex as chaos

    Noncommutativity and Discrete Physics

    Full text link
    The purpose of this paper is to present an introduction to a point of view for discrete foundations of physics. In taking a discrete stance, we find that the initial expression of physical theory must occur in a context of noncommutative algebra and noncommutative vector analysis. In this way the formalism of quantum mechanics occurs first, but not necessarily with the usual interpretations. The basis for this work is a non-commutative discrete calculus and the observation that it takes one tick of the discrete clock to measure momentum.Comment: LaTeX, 23 pages, no figure
    • …
    corecore