Results 1 to 10 of about 27,671 (167)

A quantum Samaritan’s dilemma cellular automaton [PDF]

open access: yesRoyal Society Open Science, 2017
The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed
Ramón Alonso-Sanz, Haozhen Situ
doaj   +4 more sources

Phase Space Invertible Asynchronous Cellular Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata.
Simon Wacker, Thomas Worsch
doaj   +4 more sources

Cellular automaton supercolliders [PDF]

open access: yesInternational Journal of Modern Physics C, 2011
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice.
Adamatzky A.   +28 more
core   +5 more sources

A universally programmable Quantum Cellular Automaton [PDF]

open access: yesPhysical Review Letters, 2005
We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton with external ...
D. J. Shepherd   +3 more
core   +3 more sources

Post-surjectivity and balancedness of cellular automata over groups [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Silvio Capobianco   +2 more
doaj   +4 more sources

Cellular Automata are Generic [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj   +4 more sources

Transductions Computed by One-Dimensional Cellular Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj   +4 more sources

The Thirring quantum cellular automaton [PDF]

open access: yesPhysical Review A, 2017
We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models.
Bisio, A.   +3 more
core   +5 more sources

Intrinsic Simulations between Stochastic Cellular Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner.
Pablo Arrighi   +2 more
doaj   +6 more sources

On a Periodic Soliton Cellular Automaton [PDF]

open access: yesJournal of Physics A: Mathematical and General, 2001
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the ...
  +10 more
core   +3 more sources

Home - About - Disclaimer - Privacy