scientific article
From MaRDI portal
Publication:3677179
zbMath0563.68051MaRDI QIDQ3677179
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (74)
Physical quantum algorithms ⋮ Characterization of random fluctuation-based computation in cellular automata ⋮ Some reversible image operators from the point of view of cellular automata ⋮ An algebraic approach to discrete mechanics ⋮ Random sequence generation by cellular automata ⋮ Symmetry in self-correcting cellular automata ⋮ Soliton-like behavior in automata ⋮ The cellular automata model for lipid membranes ⋮ On conservative and monotone one-dimensional cellular automata and their particle representation ⋮ Cellular automata for nanometer-scale computation ⋮ Intrinsic universality of a 1-dimensional reversible Cellular Automaton ⋮ Universality of a reversible two-counter machine ⋮ Self-reproduction in a reversible cellular space ⋮ Digital mechanics. An information process based on reversible universal cellular automata ⋮ An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior ⋮ Cellular automata as a paradigm for ecological modeling ⋮ Intractable problems in reversible cellular automata ⋮ Lyapunov exponents for one-dimensional cellular automata ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata ⋮ Collision-based implementation of a two-bit adder in excitable cellular automaton ⋮ Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton ⋮ The Transitivity Problem of Turing Machines ⋮ The Elliptic Integral Machine: A Collision-based Model of Computation ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage ⋮ Logical Gates via Gliders Collisions ⋮ On the Persistency of Gellular Automata ⋮ Simple Block-Substitution Rule Exhibits Interesting Patterns ⋮ Explicit construction of single input-single output logic gates from three soliton solution of Manakov system ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Representation of reversible cellular automata with block permutations ⋮ On time-symmetry in cellular automata ⋮ Computational universality of fungal sandpile automata ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Reversible computing and cellular automata -- a survey ⋮ A Hamiltonian for quantum copying ⋮ An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements ⋮ Artificial life with autonomously emerging boundaries ⋮ Additive conserved quantities in discrete-time lattice dynamical systems ⋮ The form of life. I: It is possible but not necessary ⋮ Reversible simulation of one-dimensional irreversible cellular automata ⋮ The solution of the sixth Hilbert problem: the ultimate Galilean revolution ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)? ⋮ Computation-universality of one-dimensional one-way reversible cellular automata ⋮ Forms of life: Unprogrammability constitutes the outside of a system and its autonomy ⋮ Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements ⋮ Intrinsically universal \(n\)-dimensional quantum cellular automata ⋮ Partitioned quantum cellular automata are intrinsically universal ⋮ Experimental implementation of collision-based gates in Belousov-Zhabotinsky medium ⋮ Collision-based computing in Belousov--Zhabotinsky medium ⋮ Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata ⋮ Number-Conserving Reversible Cellular Automata and Their Computation-Universality ⋮ Theory of cellular automata: a survey ⋮ Universality of Reversible Hexagonal Cellular Automata ⋮ A cellular automaton model for the transmission of Chagas disease in heterogeneous landscape and host community ⋮ An instruction set for reversible Turing machines ⋮ When-and how-can a cellular automaton be rewritten as a lattice gas? ⋮ Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata ⋮ Pre-expansivity in cellular automata ⋮ New dimensions in non‐classical neural computing, part II: quantum, nano, and optical ⋮ Circuits form‐valued classical, reversible and quantum optical computing with application to regular logic design ⋮ New dimensions in non‐classical neural computing ⋮ Frontier between decidability and undecidability: A survey ⋮ On fungal automata ⋮ Reversible cellular automata with memory: two-dimensional patterns from a single site seed ⋮ Knot invariants and cellular automata ⋮ Invertible cellular automata: A review ⋮ A Survey on Analog Models of Computation ⋮ Replication of spatial patterns with reversible and additive cellular automata ⋮ Glider-based computing in reaction-diffusion hexagonal cellular automata
Cites Work
This page was built for publication:
