اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSelection of Catalysts through Cellular Reproduction
79
0
0.0
(
0
)
تأليف
N. Ono
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It has been pointed out that if an autocatalytic cycle produces primitive membrane chemicals, it can compose a self-maintaining proto cell. Moreover, it is known that a proto cell can divide itself spontaneously as it grows. An unsolved problem is how such a catalytic system can evolve in the pre-cellular environment. Here we examine, as the first step, the evolution of catalysts that have different activity in generating membrane chemicals using a Lattice-Gas-like model. We demonstrated that a self-replicating proto-cell emerges from random initial configuration. We also showed that cells with higher activity of membrane production evolve through cellular selection.
قيم البحث
اقرأ أيضاً
121 -
Demosthenes Ellinas
, Elena P. Papadopoulou
, Yiannis G. Saridakisn (Department of Sciences
2000
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian describin
g a quantum chain model is constructed. The intrinsic parallelism of QSCA, a phenomenon first known from quantum computers, is also emphasized.
A cellular automata (CA) configuration is constructed that exhibits emergent failover. The configuration is based on standard Game of Life rules. Gliders and glider-guns form the core messaging structure in the configuration. The blinker is represent
ed as the basic computational unit, and it is shown how it can be recreated in case of a failure. Stateless failover using primary-backup mechanism is demonstrated. The details of the CA components used in the configuration and its working are described, and a simulation of the complete configuration is also presented.
The transport and chemical reactions of solutes are modelled as a cellular automaton in which molecules of different species perform a random walk on a regular lattice and react according to a local probabilistic rule. The model describes advection a
nd diffusion in a simple way, and as no restriction is placed on the number of particles at a lattice site, it is also able to describe a wide variety of chemical reactions. Assuming molecular chaos and a smooth density function, we obtain the standard reaction-transport equations in the continuum limit. Simulations on one- and two-dimensional lattices show that the discrete model can be used to approximate the solutions of the continuum equations. We discuss discrepancies which arise from correlations between molecules and how these disappear as the continuum limit is approached. Of particular interest are simulations displaying long-time behaviour which depends on long-wavelength statistical fluctuations not accounted for by the standard equations. The model is applied to the reactions $a + b rightleftharpoons c$ and $a + b rightarrow c$ with homogeneous and inhomogeneous initial conditions as well as to systems subject to autocatalytic reactions and displaying spontaneous formation of spatial concentration patterns.
Gauge-invariance is a fundamental concept in Physics---known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of Cellular Automa
ta. More precisely, the notions of gauge-invariance and gauge-equivalence in Cellular Automata are formalized. A step-by-step gauging procedure to enforce this symmetry upon a given Cellular Automaton is developed, and three examples of gauge-invariant Cellular Automata are examined.
In this paper we study the family of freezing cellular automata (FCA) in the context of asynchronous updating schemes. A cellular automaton is called freezing if there exists an order of its states, and the transitions are only allowed to go from a l
ower to a higher state. A cellular automaton is asynchronous if at each time-step only one cell is updated. Given configuration, we say that a cell is unstable if there exists a sequential updating scheme that changes its state. In this context, we define the problem AsyncUnstability, which consists in deciding if a cell is unstable or not. In general AsyncUnstability is in NP, and we study in which cases we can solve the problem by a more efficient algorithm. We begin showing that AsyncUnstability is in NL for any one-dimensional FCA. Then we focus on the family of life-like freezing CA (LFCA), which is a family of two-dimensional two-state FCA that generalize the freezing version of the game of life, known as life without death. We study the complexity of AsyncUnstability for all LFCA in the triangular and square grids, showing that almost all of them can be solved in NC, except for one rule for which the problem is NP-complete.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
