scholarly journals A quantum Samaritan’s dilemma cellular automaton

2017 ◽  
Vol 4 (6) ◽  
pp. 160669 ◽  
Author(s):  
Ramón Alonso-Sanz ◽  
Haozhen Situ

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 in fair and unfair contests, in noiseless scenarios and with disrupting quantum noise.

Author(s):  
Ramón Alonso-Sanz

The dynamics of a spatial quantum formulation of the iterated prisoner's dilemma game is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The evolution is driven by the imitation of the best neighbour. It is shown how spatial structure enables in fully quantum contests a dramatically rapid emergence of mutual cooperation. In unfair contests, such as quantum versus classic players, the velocity in which the quantum players take advantage of its privileged status is also very notable.


Author(s):  
Ramón Alonso-Sanz

The dynamics of a spatial quantum formulation of the iterated battle of the sexes game is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The effect of spatial structure is assessed in the quantum versus quantum players contest as well as in the unfair quantum versus classical players contest. The case of partial entangling is also scrutinized.


2020 ◽  
Vol 29 (4) ◽  
pp. 741-757
Author(s):  
Kateryna Hazdiuk ◽  
◽  
Volodymyr Zhikharevich ◽  
Serhiy Ostapov ◽  
◽  
...  

This paper deals with the issue of model construction of the self-regeneration and self-replication processes using movable cellular automata (MCAs). The rules of cellular automaton (CA) interactions are found according to the concept of equilibrium neighborhood. The method is implemented by establishing these rules between different types of cellular automata (CAs). Several models for two- and three-dimensional cases are described, which depict both stable and unstable structures. As a result, computer models imitating such natural phenomena as self-replication and self-regeneration are obtained and graphically presented.


1993 ◽  
Vol 03 (02) ◽  
pp. 293-321 ◽  
Author(s):  
JÜRGEN WEITKÄMPER

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.


2004 ◽  
Vol 120 ◽  
pp. 225-230
Author(s):  
P. Mukhopadhyay ◽  
M. Loeck ◽  
G. Gottstein

A more refined 3D cellular Automata (CA) algorithm has been developed which has increased the resolution of the space and reduced the computation time and can take care of the complexity of recrystallization process through physically based solutions. This model includes recovery, condition for nucleation and orientation dependent variable nuclei growth as a process of primary static recrystallization. Incorporation of microchemistry effects makes this model suitable for simulating recrystallization behaviour in terms of texture, kinetics and microstructure of different alloys. The model is flexible to couple up with other simulation programs on a common database.


1998 ◽  
Vol 12 (05) ◽  
pp. 601-607 ◽  
Author(s):  
M. Andrecut

Wave propagation in excitable media provides an important example of spatiotemporal self-organization. The Belousov–Zhabotinsky (BZ) reaction and the impulse propagation along nerve axons are two well-known examples of this phenomenon. Excitable media have been modelled by continuous partial differential equations and by discrete cellular automata. Here we describe a simple three-states cellular automaton model based on the properties of excitation and recovery that are essential to excitable media. Our model is able to reproduce the dynamics of patterns observed in excitable media.


Author(s):  
Francesc S. Beltran ◽  
Salvador Herrando ◽  
Violant Estreder ◽  
Doris Ferreres ◽  
Marc-Antoni Adell ◽  
...  

Language extinction is a widespread social phenomenon affecting several million people throughout the world today. By the end of this century, more than 5100 of the approximately 6000 languages currently spoken around the world will have disappeared. This is mainly because of language shifts, i.e., because a community of speakers stops using their traditional language and speaks a new one in all communication settings. In this study, the authors present the properties of a cellular automaton that incorporates some assumptions from the Gaelic-Arvanitika model of language shifts and the findings on the dynamics of social impacts in the field of social psychology. To assess the cellular automaton, the authors incorporate empirical data from Valencia (a region in Southern Europe), where Catalan speakers are tending to shift towards using Spanish. Running the automaton under different scenarios, the survival or extinction of Catalan in Valencia depends on individuals’ engagement with their language. The authors discuss how a cellular automata theory approach proves to be a useful tool for understanding the language shift.


2019 ◽  
Vol 19 (4) ◽  
pp. 759-772 ◽  
Author(s):  
Jarkko Kari ◽  
Ville Salo ◽  
Thomas Worsch

Abstract We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.


2009 ◽  
Vol 45 (12) ◽  
pp. 607 ◽  
Author(s):  
V.A. Mardiris ◽  
I.G. Karafyllidis

Sign in / Sign up

Export Citation Format

Share Document