Graph Turing machines

DOI10.1007/978-3-662-55386-2_1zbMath1491.68068OpenAlexW2727423609MaRDI QIDQ1685904

Cameron E. Freer, Nathanael Leedom Ackerman

Publication date: 20 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-662-55386-2_1

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (11)

On the dynamics of semilattice networks ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Dynamical attraction in parallel network models ⋮ Periods in XOR parallel dynamical systems over directed dependency graphs ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems

This page was built for publication: Graph Turing machines