BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The busy beaver game: a simple yet non-computable function - Yi Ca
 i\, Newnham College
DTSTART:20200205T190000Z
DTEND:20200205T193000Z
UID:TALK139489@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Do you know any function that is even worse than the Ackermann
  function? The busy beaver game\, first introduced by Tibor Radó in 1961\
 , is a fun question related to computability theory\, the halting problem 
 as well as complexity theory. The goal of the game is to find the maximum 
 number of 1s on your tape for your given Turing machine after it halts. Al
 though the busy beaver game is quite easy to understand and implement\, it
  can be shown to grow faster asymptotically than any computable function. 
 In this talk\, we will explore the simple instance of a non-computable fun
 ction and give some simple proof on its non-computability.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR