What is meant by non-deterministic Turing machine in Theory of Automata and Formal Languages?

Correct Answer: A

a TM variant that may have multiple possible moves from a configuration

The correct answer is a TM variant that may have multiple possible moves from a configuration.