English
Related papers

Related papers: Solving the initial value problem for cellular aut…

200 papers

The form of the initial value constraints in Ashtekar's hamiltonian formulation of general relativity is recalled, and the problem of solving them is compared with that in the traditional metric variables. It is shown how the general…

General Relativity and Quantum Cosmology · Physics 2007-05-23 R. Capovilla , J. Dell , T. Jacobson

Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…

Quantum Physics · Physics 2025-07-28 Thiago L. M. Guedes , Don Winter , Markus Müller

Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…

Cellular Automata and Lattice Gases · Physics 2023-08-15 Abhishek Dalai

The choice of the parameter value for regularized inverse problems is critical to the results and remains a topic of interest. This article explores a criterion for selecting a good parameter value by maximizing the probability of the data,…

Numerical Analysis · Mathematics 2020-02-11 Toby Sanders , Rodrigo B. Platte , Robert D. Skeel

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…

Cellular Automata and Lattice Gases · Physics 2007-05-23 J. R. Sanchez , R. Lopez-Ruiz

A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing P-complete…

Computational Complexity · Computer Science 2009-06-18 Alexander Okhotin

An algorithm for constructing a control function that transfers a wide class of stationary nonlinear systems of ordinary differential equations from an initial state to a final state under certain control restrictions is proposed. The…

Optimization and Control · Mathematics 2017-03-01 Alexander N. Kvitko , Oksana S. Firyulina , Alexey S. Eremin

In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series applications. Besides selecting the models' hyperparameters, the proposed algorithm particularly solves…

Machine Learning · Computer Science 2024-02-15 Jonas Kantic , Fabian C. Legl , Walter Stechele , Jakob Hermann

We introduce several concepts such as prime and composite rule, tools and methods for causal composition and decomposition. We discover and prove new universality results in ECA, namely, that the Boolean composition of ECA rules 51 and 118,…

Cellular Automata and Lattice Gases · Physics 2018-02-27 Jürgen Riedel , Hector Zenil

In this paper a special type of difference equations is investigated. The impulses start abruptly at some points and their action continue on given finite intervals. This type of equations is used to model a real process. An algorithm,…

Dynamical Systems · Mathematics 2017-02-10 S. Hristova

Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…

Cellular Automata and Lattice Gases · Physics 2014-03-04 Markus Redeker

This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…

Computational Complexity · Computer Science 2007-05-23 Maxim Makatchev

This paper investigates the simultaneous identification of a spatially dependent potential and the initial condition in a subdiffusion model based on two terminal observations. The existence, uniqueness, and conditional stability of the…

Numerical Analysis · Mathematics 2025-10-28 Xu Wu , Jiang Yang , Zhi Zhou

We study cellular automata with randomly selected rules. Our setting are two-neighbor rules with a large number $n$ of states. The main quantity we analyze is the asymptotic probability, as $n \to \infty$, that the random rule has a…

Probability · Mathematics 2019-09-17 Janko Gravner , Xiaochen Liu

In this paper we focus on the initial-boundary value problem of the 2-D isentropic Euler equations with damping. We prove the global-in-time existence of classical solution to the initial-boundary value problem by the method of energy…

Analysis of PDEs · Mathematics 2008-03-04 Yongqin Liu , Weike Wang

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…

There is recent interest in the inter and intra element interactions of metamaterial unit cells. To calculate the effects of these interactions which can be substantial, an ab initio general coupled mode equation, in the form of an…

Other Condensed Matter · Physics 2015-06-05 Sameh Y. Elnaggar , Richard Tervo , Saba M. Mattar

In this paper we consider an initial boundary value problem for a semilinear parabolic equation with nonlinear nonlocal boundary condition. We prove comparison principle, the existence theorem of a local solution and study the problem of…

Analysis of PDEs · Mathematics 2014-12-17 Alexander Gladkov , Tatiana Kavitova

Chen and Hsiao gave the numerical solution of initial value problems of systems of linear differential equations with constant coefficients by Walsh polynomials approach. This result was improved by G\'at and Toledo for initial value…

Classical Analysis and ODEs · Mathematics 2020-06-26 Károly Nagy

In automata theory, while determinisation provides a standard route to solving many common problems in automata theory, some weak forms of nondeterminism can be dealt with in some problems without costly determinisation. For example, the…

Formal Languages and Automata Theory · Computer Science 2026-05-29 Thomas A. Henzinger , Keya Prakash , K. S. Thejaswini
‹ Prev 1 8 9 10 Next ›