Machines, Computations, and Universality
From MaRDI portal
Publication:5710896
DOI10.1007/b106980zbMath1102.03304MaRDI QIDQ5710896
Blondel, Vincent D., Petr Kůrka, Jean-Charles Delvenne
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106980
Related Items
About the Domino Problem for Subshifts on Groups, Nonlinear dynamics as an engine of computation, A Survey on Analog Models of Computation, Retracted: Universal computation is `almost surely' chaotic, Topological chaos of universal elementary cellular automata rule, Computational complexity of dynamical systems: the case of cellular automata, Computability and Beltrami fields in Euclidean space, Decidability and universality of quasiminimal subshifts