The Halting Problem

Every Player Loose AND Win the game.
If playing in a tournament, add one win and one loss to the player's score.
Alan Turing proved in 1936 that a general algorithm running on a Turing machine that solves the halting problem for all possible program-input pairs necessarily cannot exist. Hence, the halting problem is undecidable for Turing machines.