Symmetric Turing machine

A symmetric Turing machine is a Turing machine that has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.