Define the Halting Problem formally and provide a clear, theoretical proof of its undecidability using a diagonalization argument. Discuss the profound implications this result has for the foundations of mathematics and computer science, specifically regarding the existence of problems that are inherently unsolvable by algorithmic means.