اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSelf-referencing cellular automata: A model of the evolution of information control in biological systems
154
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial selection for function has recently become a powerful tool for understanding how evolution can innovate within its genetic rule space. However, conventional cellular automata lack the kind of state feedback that is surely present in natural evolving systems. Each new generation of a population leaves an indelible mark on its environment and thus affects the selective pressures that shape future generations of that population. To model this phenomenon, we have augmented traditional cellular automata with state-dependent feedback. Rather than generating automata executions from an initial condition and a static rule, we introduce mappings which generate iteration rules from the cellular automaton itself. We show that these new automata contain disconnected regions which locally act like conventional automata, thus encapsulating multiple functions into one structure. Consequently, we have provided a new model for processes like cell differentiation. Finally, by studying the size of these regions, we provide additional evidence that the dynamics of self-reference may be critical to understanding the evolution of natural language. In particular, the rules of elementary cellular automata appear to be distributed in the same way as words in the corpus of a natural language.
قيم البحث
اقرأ أيضاً
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules with comp
lex behavior a dynamic competition among all the possible stable patterns is established and no stationary regime is reached. For the particular rule coded by the decimal number 18, a self-synchronization phenomenon can be obtained, even when strong modifications to the synchronization method are applied.
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic background
. Frequently, this type of automata has been found through either an exhaustive search or a meticulous construction of the evolution rule. In this study, the specification of cellular automata with complex behaviors was obtained by utilizing randomly generated specimens. In particular, it proposed that a cellular automaton of $n$ states should be specified at random and then extended to another automaton with a higher number of states so that the original automaton operates as a periodic background where the additional states serve to define the gliders. Moreover, this study presented an explanation of this method. Furthermore, the random way of defining complex cellular automata was studied by using mean-field approximations for various states and local entropy measures. This specification was refined with a genetic algorithm to obtain specimens with a higher degree of complexity. With this methodology, it was possible to generate complex automata with hundreds of states, demonstrating that randomly defined local interactions with multiple states can construct complexity.
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show
how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly omega steps.
The transmission of vector infectious diseases, which produces complex spatiotemporal patterns, is analyzed by a periodically forced two-dimensional cellular automata model. The system, which comprises three population levels, is introduced to descri
be complex features of the dynamics of the vector transmitted dengue epidemics, known to be very sensitive to seasonal variables. The three coupled levels represent the human, the adult and immature vector populations. The dynamics includes external seasonality forcing (rainfall intensity data), human and mosquito mobility, and vector control effects. The model parameters, even if bounded to well defined intervals obtained from reported data, can be selected to reproduce specific epidemic outbursts. In the current study, explicit results are obtained by comparison with actual data retrieved from the time-series of dengue epidemics in two cities in Brazil. The results show fluctuations that are not captured by mean-field models. It also reveals the qualitative behavior of the spatiotemporal patterns of the epidemics. In the extreme situation of absence of external periodic drive, the model predicts completely distinct long time evolution. The model is robust in the sense that it is able to reproduce the time series of dengue epidemics of different cities, provided the forcing term takes into account the local rainfall modulation. Finally, the dependence between epidemics threshold and vector control undergoes a transition from power law to stretched exponential behavior due to human mobility effect.
Gauge symmetries play a fundamental role in Physics, as they provide a mathematical justification for the fundamental forces. Usually, one starts from a non-interactive theory which governs `matter, and features a global symmetry. One then extends th
e theory so as make the global symmetry into a local one (a.k.a gauge-invariance). We formalise a discrete counterpart of this process, known as gauge extension, within the Computer Science framework of Cellular Automata (CA). We prove that the CA which admit a relative gauge extension are exactly the globally symmetric ones (a.k.a the colour-blind). We prove that any CA admits a non-relative gauge extension. Both constructions yield universal gauge-invariant CA, but the latter allows for a first example where the gauge extension mediates interactions within the initial CA.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
