 Thus if a Turing machine \(H\) decides the halting problem, we can use it to determine for an arbitrary Turing machine \(A\) and arbitrary input \(x\) whether \(A\) will halt on input \(x\) or not. The undecidability of the halting problem is the following result, due to Turing (1937), stating that no such machine can exist: 