The Halting Problem Explained & Contested by an Alien Robot

This video explains the halting problem in simple terms, and the proof of undecidability is contested by an alien robot. Who do you think is right, your fellow humans or Tara the alien robot? It covers how David Hilbert's "is mathematics decidable?" challenge was met by Kurt Gödel, Alonso Church and Alan Turing. Turing's proof relied on his concept of a 'Turing machine' which is now considered to be the only model of a computer that is ever needed in mathematics. It is claimed that Turing's proof shows that we will never be able to write a program which can determine if another program + its data will go into a loop or not. This proof is described in simple terms and then the logic is contested by an alien robot.