A formal definition of a Turing Machine is a set of states, the input alphabet, the work tape alphabet, the transition function, the start state, and the accepting states. It is a mathematical representation of the machine.
A formal definition of a Turing Machine is a set of states, the input alphabet, the work tape alphabet, the transition function, the start state, and the accepting states. It is a mathematical representation of the machine.