Turning Machine - Halting Problem

A Halting Problem of Turning machine is the problem of deciding whether or not a given Turning machine should halt when it no longer has available moves. If it halts in its final state, it accepts its input; otherwise, it rejects its input.

In Automata, a halting problem is defined as -

There is a Turning Machine (M), over an alphabet Σ(a,b), the problem is : does M halt when it is given w as an input string.

A halting problem is undecidable.