The undecidability of halting problem for Turing machines implies that

a	it is impossible to write a program that will decide for every program if it halts for given data
b	you must use your brain to solve the problem if the program halts for given data
c	each problem to which the halting problem is reduced is undecidable

not only one can be correct