What type of Turing machine listed in this article would most likely use an undirected graph (i.e. path A-B-C is the same as C-B-A)? Given the previous question, write a context that contains the answer. It can be 1 - 20 sentences. Context:
Many types of Turing machines are used to define complexity classes, such as deterministic Turing machines, probabilistic Turing machines, non-deterministic Turing machines, quantum Turing machines, symmetric Turing machines and alternating Turing machines. They are all equally powerful in principle, but when resources (such as time or space) are bounded, some of these may be more powerful than others.