Explain the diagonalization argument used by Alan Turing to prove that the halting problem is undecidable. Discuss how this proof establishes the fundamental limits of algorithmic computation and relate it to the concept of reduction in computability theory.