- Published 2017 in WoLLIC

We consider graph Turing machines, a model of parallel computation on a graph, which provides a natural generalization of several standard computational models, including ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute. We also begin the study of the relationship between the computational power of a graph Turing machine and structural properties of its underlying graph.

@inproceedings{Ackerman2017GraphTM,
title={Graph Turing Machines},
author={Nathanael Leedom Ackerman and Cameron E. Freer},
booktitle={WoLLIC},
year={2017}
}