A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search