Provably undecidable problems

1: The halting problem
2: The quotation problem

The so-called Pissball algorithm, which has been proven to determine the answer to the famous mathematical question: "How long does it take for piss to land on balls?"

Closely related is the >>Traveling bricksock problem<<.