Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0906.3213

Intrinsically Universal Cellular Automata

Nicolas Ollinger
View original source ↗Read source document ↗Export metadata ↓

Abstract

This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for proving non universality.

Explore related subjects

cs.CCcs.FL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Ollinger. 2009-06-17. Intrinsically Universal Cellular Automata. https://doi.org/10.4204/eptcs.1.19

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗
arXiv2026

Euclidean SVP is NP-hard for Cyclic Lattices

We prove that exact Euclidean SVP is NP-hard under deterministic polynomial-time many-one reductions for full-rank cyclic integer lattices, equivalently full-rank ideals of $R_N:=\mathbb{Z}[X]/(X^N-1)$ in the coefficient norm. Hardness holds with $N=q-1$ for a varying odd prime $q$. As an application, we prove the same hardness for the algebraic class of NTRU-form lattices $\{(x,z)\in R_N^2:Hx\equiv z\pmod{QR_N}\}$, where $H,Q$ are unrestricted inputs. The decision problems are NP-complete, and the exact search problems are NP-hard under polynomial-time Turing reductions. No hardness claim is made for cryptographic NTRU parameter subclasses or key-generation distributions.

cs.CC↗
arXiv2026

Constructive solvability and the P versus NP problem

The relation between the computational complexity class NP and other complexity classes is addressed in the context of provability and limitations on the possibility of finding sound axioms for formal theories. We construct a family D of decision problems and show that under a certain finiteness condition, D contains a problem which is in NP. Further, it is shown that if the term ``constructible theory'' is defined in a way satisfying a specific natural condition, then no constructible and sound theory verifies a solution algorithm for any of the problems in D. Arguably, this solves the P versus NP problem under a constructive interpretation. The relation to classical proofs of NP $\subseteq$ EXPTIME is discussed. These proofs tacitly use an assumption which may fail for problems in D.

cs.CC↗