# How can Turing complete machines exist theoretically if the halting problem is undecidable

As the question says, if I input on the tape of a Turing complete machine a program that solves the halting problem with the correct inputs the program will never end its execution regardless of memory and time. Isn't the halting problem a computational problem that can't be executed by a Turing complete machine so that it's halts sometime?

• What I meant is that I can give a program H(x) that supposedly solves the halting problem and we do: P(x) = run H(x) If H(x) halts then loop forever else halt this program will loop forever regardless of time or memory so this is a computational problem that can´t be solve by a Turing Machine regardless of memory and time as I said before Nov 7 '19 at 21:40