Graph Turing machines

DOI10.1007/978-3-662-55386-2_1MaRDI QIDQ1685904zbMATH OpenOpenAlexFDO

Authors Cameron E. Freer, Nathanael 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

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

Recommendations

• A computational model for generic graph functions
• Turing machines on Cayley graphs
• Expressiveness and complexity of generic graph machines
• scientific article; zbMATH DE number 1985710
• Parallel turing machines with one-head control units and cellular automata

Cited in

(19)

• Counting periodic points in parallel graph dynamical systems
• Dynamical attraction in parallel network models
• scientific article; zbMATH DE number 7604432 (Why is no real title available?)
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Turing machines on Cayley graphs
• On the dynamics of semilattice networks
• Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• scientific article; zbMATH DE number 1738661 (Why is no real title available?)
• Maximum number of periodic orbits in parallel dynamical systems
• Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
• On the transition graphs of Turing machines.
• scientific article; zbMATH DE number 3861220 (Why is no real title available?)
• scientific article; zbMATH DE number 1505867 (Why is no real title available?)
• Periods in XOR parallel dynamical systems over directed dependency graphs
• Enumerating periodic orbits in sequential dynamical systems over graphs
• Time and space measures for a complete graph computation model
• Some machines defined by directed graphs
• Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs

This page was built for publication: Graph Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685904)