The halting problem has been proven definitively undecidable via proof by contradiction, by Alan Turing. The proof implicitly created the notion of Turing machines, a key model of computation.

There is a solution to the halting problem. It’s that it is undecidable.