Reversible cellular automata with memory of delay type

The effect of delay type memory of past states on reversible elementary cellular automata (CA) is examined in this study. It is assessed in simple scenarios, such as elementary CA, but the feasibility of enriching the dynamics with memory in a general reversible CA context is also outlined. © 2014 Wiley Periodicals, Inc. Complexity 20: 49–56, 2014     

Some applications of propositional logic to cellular automata

In this paper we give a new proof of Richardson's theorem [31]: a global function G_?? of a cellular automaton ?? is injective if and only if the inverse of G_?? is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation from [20]. We also solve two problems regarding complexity of cellular automata formulated by Durand [12] (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

How to make dull cellular automata complex by adding memory: Rule 126 case study

Using Rule 126 elementary cellular automaton (ECA), we demonstrate that a chaotic discrete system — when enriched with memory — hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced from original information of the ahistorical system. First, we analyze classic ECA Rule 126 to identify basic characteristics with mean field theory, basins, and de Bruijn diagrams. To derive this complex dynamics, we use a kind of memory on Rule 126; from here interactions between gliders are studied for detecting stationary patterns, glider guns, and simulating specific simple computable functions produced by glider collisions. © 2010 Wiley Periodicals, Inc. Complexity, 2010     

Multicolor particle systems with large threshold and range

In this paper we consider the Greenberg-Hastings and cyclic color models. These models exhibit (at least) three different types of behavior. Depending on the number of colors and the size of two parameters called the threshold and range, the Greenberg-Hastings model either dies out, or has equilibria that consist of debris or fire fronts. The phase diagram for the cyclic color models is more complicated. The main result of this paper, Theorem 1, proves that the debris phase exists for both systems.     

An efficient approach to solve very large dense linear systems with verified computing on clusters

Automatic result verification is an important tool to guarantee that completely inaccurate results cannot be used for decisions without getting remarked during a numerical computation. Mathematical rigor provided by verified computing allows the computation of an enclosure containing the exact solution of a given problem. Particularly, the computation of linear systems can strongly benefit from this technique in terms of reliability of results. However, in order to compute an enclosure of the exact result of a linear system, more floating‐point operations are necessary, consequently increasing the execution time. In this context, parallelism appears as a good alternative to improve the solver performance. In this paper, we present an approach to solve very large dense linear systems with verified computing on clusters. This approach enabled our parallel solver to compute huge linear systems with point or interval input matrices with dimensions up to 100,000. Numerical experiments show that the new version of our parallel solver introduced in this paper provides good relative speedups and delivers a reliable enclosure of the exact results. Copyright © 2014 John Wiley & Sons, Ltd.     

Global classical large solutions to 1D compressible Navier-Stokes equations with density-dependent viscosity and vacuum

In this paper, we investigate an initial boundary value problem for 1D compressible isentropic Navier-Stokes equations with large initial data, density-dependent viscosity, external force, and vacuum. Making full use of the local estimates of the solutions in Cho and Kim (2006) [3] and the one-dimensional properties of the equations and the Sobolev inequalities, we get a unique global classical solution (ρ,u) where ρ∈C¹([0,T];H¹([0,1])) and u∈H¹([0,T];H²([0,1])) for any T>0. As it is pointed out in Xin (1998) [31] that the smooth solution (ρ,u)∈C¹([0,T];H³(R¹)) (T is large enough) of the Cauchy problem must blow up in finite time when the initial density is of nontrivial compact support. It seems that the regularities of the solutions we obtained can be improved, which motivates us to obtain some new estimates with the help of a new test function ρ²utt, such as Lemmas 3.2-3.6. This leads to further regularities of (ρ,u) where ρ∈C¹([0,T];H³([0,1])), u∈H¹([0,T];H³([0,1])). It is still open whether the regularity of u could be improved to C¹([0,T];H³([0,1])) with the appearance of vacuum, since it is not obvious that the solutions in C¹([0,T];H³([0,1])) to the initial boundary value problem must blow up in finite time.