In the determination of complexity classes, what are two examples of types of 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.