Year: 2022
Type: preprint
Abstract: We propose two hard problems in cellular automata. In particular the problems are: [DDP$^M_{n,p}$] Given two \emph{randomly} chosen configurations $t$ and $s$ of a cellular automata of length $n$, find the number of transitions $τ$ between $s$ and $t$. [SDDP$^δ_{k,n}$] Given two \emph{randomly} chosen configurations $s$ of a cellular automata of length $n$ and $x$ of length $k
Source: arXiv (Cornell University)
Author: Sur, Souvik
Institution: Indian Institute of Technology Kharagpur
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4226285751