Abstract Graph Machines
Joshua Herman, Keith David Pedersen · arXiv (Cornell University) · 2008
This paper describes a new automata which is Turing Complete. These algorithms use a data structure which can be described as an abstract graph representation. The construction of this machine can be described as a matrix machine performing operations on the data set. This outlines both a deterministic and nondeterministic operation of the machine. Also a possible implementation of the Blum Shub Smale machine is created utilizing this architecture.