ترغب بنشر مسار تعليمي؟ اضغط هنا

Cellular automaton supercolliders

174   0   0.0 ( 0 )
 نشر من قبل Andrew Adamatzky
 تاريخ النشر 2011
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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. They are cellular-automaton analogous of localizations or quasi-local collective excitations travelling in a spatially extended non-linear medium. They can be considered as binary strings or symbols travelling along a one-dimensional ring, interacting with each other and changing their states, or symbolic values, as a result of interactions. We analyse what types of interaction occur between gliders travelling on a cellular automaton `cyclotron and build a catalog of the most common reactions. We demonstrate that collisions between gliders emulate the basic types of interaction that occur between localizations in non-linear media: fusion, elastic collision, and soliton-like collision. Computational outcomes of a swarm of gliders circling on a one-dimensional torus are analysed via implementation of cyclic tag systems.



قيم البحث

اقرأ أيضاً

131 - K. M. Lee , Hao Xu , H. F. Chau 2001
The parity of a bit string of length $N$ is a global quantity that can be efficiently compute using a global counter in ${O} (N)$ time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any gl obal counter? Here, we report a way to solve this problem using a number of $r=1$ binary, uniform, parallel and deterministic cellular automata applied in succession for a total of ${O} (N^2)$ time.
The problem `human and work in a model working group is investigated by means of cellular automata technique. Attitude of members of a group towards work is measured by an indicator of loyalty to the group (the number of agents who carry out their ta sks), and lack of loyalty (the number of agents, who give their tasks to other agents). Initially, all agents realize scheduled tasks one-by-one. Agents with the number of scheduled tasks larger than a given threshold change their strategy to unloyal one and start avoiding completing tasks by passing them to their colleagues. Optionally, in some conditions, we allow agents to return to loyal state; hence the rule is hysteretic. Results are presented on an influence of i) the density of tasks, ii) the threshold number of tasks assigned to the agents forcing him/her for strategy change on the system efficiency. We show that a `black scenario of the system stacking in a `jammed phase (with all agents preferring unloyal strategy and having plenty tasks scheduled for realization) may be avoided when return to loyalty is allowed and either i) the number of agents chosen for task realization, or ii) the number of assigned tasks, or iii) the threshold value of assigned tasks, which force the agent to conversion from loyal strategy to unloyal one, or iv) the threshold value of tasks assigned to unloyal agent, which force him/her to task redistribution among his/her neighbors, are smartly chosen.
132 - H. F. Chau , H. Xu , K. M. Lee 2001
Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $[0,1]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of $f( rho)$ where $rho$ is the (number) density of 1s in an arbitrarily given bit string of finite length provided that $f$ satisfies certain technical conditions.
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of collidin g signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.
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. In particular, we found a wider v ariety of scattering processes, we have bound states for every value of the total momentum, and there exist bound states also in the free case, where the coupling constant is null.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا