archive
Every paper Pith has read. Search by title, abstract, or pith.
26 papers in nlin.CG · page 1
-
Exact stopping time formulas derived for deterministic traffic
First-passage processes in a deterministic one-dimensional cellular automaton model of traffic flow
-
V-complexity measures function complexity with piecewise segments
The information-theoretic complexity of differentiable functions
-
APT interfaces cross over to KPZ fluctuations at long times
Universal interface fluctuations in absorbing-state phase transitions
-
Positive-rate PCAs with Bernoulli measures mix logarithmically
Positive-rate PCA and IPS with stationary Bernoulli measures are rapidly forgetful
-
Classical transport equations encode quantum mechanics
Quantum mechanics for classical transport equations
-
Non-uniform cellular automata run on hyperbolic lattices
Universal Design and Physical Applications of Non-Uniform Cellular Automata on Translationally Invariant Lattices
-
Ising machines beat Potts machines on Max-3-Cut and Max-4-Cut
Comparative Study of Potts Machine Dynamics and Performance for Max-k-Cut
-
Ising machine outperforms every Potts machine on Max-k-Cut
Comparative Study of Potts Machine Dynamics and Performance for Max-k-Cut
-
Cellular automaton decoder hits 7.5% threshold on toric code
High-performance cellular automaton decoders for quantum repetition and toric code
-
Game of Life patterns show temporal retention as biosignature
Temporal Retention of Information as a Biosignature
-
Trajectory data fixes identifiability in transport models
When do trajectories matter? Identifiability analysis for stochastic transport phenomena
-
Count data alone leaves diffusion parameters unidentified
When do trajectories matter? Identifiability analysis for stochastic transport phenomena
-
Game of Life patches become programmable semigroups
Measuring the Computational Power of Finite Patches of Cellular Automata
-
Tuned energy landscape unifies bunching and meandering
Step Bunching and Meandering as Common Growth Modes: A Discrete Model and a Continuum Description
-
Frustrated vote automata bifurcate density above critical range
Coarsening and Bifurcations in Wide-Range Two-Dimensional Totalistic Cellular Automata
-
Linear cellular automata controllable exactly when matrix is invertible
General control of linear cellular automata
-
Agents learn to control passive automata but fail on active ones
Control of Cellular Automata by Moving Agents with Reinforcement Learning
-
Extended Petri net detects faults across continuous and discrete dynamics
Extended Hybrid Timed Petri Nets with Semi-Supervised Anomaly Detection for Switched Systems, Modelling and Fault Detection
-
Rule 22 formula measures Rule 30 asymmetry growth
Symmetric Nonlinear Cellular Automata as Algebraic References for Rule~30
-
Randomness makes these cellular automata forget their starting states
Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232
-
Signal exchange decodes toric code locally below threshold
Local decoder for the toric code via signal exchange
-
Lazy automata order bounded by pattern fibers
On the order of lazy cellular automata
-
One active transition splits cellular automata into idempotent or strictly almost equicomp
One-dimensional cellular automata with a unique active transition
-
Ergodic rules fully classified for CA with 3 to 5 states
Complete ergodicity in one-dimensional reversible cellular automata
-
One contact rule generates five cancer growth laws
Universal principles of cell population growth follow from local contact inhibition
-
Algorithms decide reversibility of large 1D automata in polynomial time
Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity
-
Any Turing machine converts to a one-dimensional cellular automaton
Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour
-
GKZ hypergeometric function yields PBCA configuration probabilities
Evaluation on asymptotic distribution of particle systems expressed by probabilistic cellular automata