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 desribed 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.
Short discussion
What I have noticed after studing the graph isomorphism problem for the past year is a new type of machine. To put it simply it is a turing complete machine which uses graphs as its fundamental method of storage. To change its state it uses homomorphisms of the graph through changing the labeling of the adjacency matrix. The labeling is also represented as a vector.
0 comments:
Post a Comment