In the 1960s, mathematician and computer scientist Gregory Chaitin published a landmark paper in the field of algorithmic information theory in the Journal of the ACM – and he was only a teenager. Since then he’s explored mathematics, computer science, and even gotten a mathematical constant named after him. Robert J. Marks leads the discussion with Professor Gregory Chaitin on Read More ›
If you are a nerd, the musical Fermat’s Last Tango (2001) is hilarious. Mathematician Pierre de Fermat proposed his last theorem around 1637. He wrote a note in the margin of a copy of Arithmetica, a book written by a 3rd-century Alexandrian mathematician, Diophantus. Fermat’s short scribble claimed that he could prove that a specific Diophantine equation had no solution. But whatever Fermat was thinking died with him in 1665. A proof of Fermat’s last theorem eluded mathematicians over 300 years until Princeton’s Andrew Wiles proved it in 1995. Fermat’s Last Tango is a fantasy account of Wiles’s life while he was working on the proof. The play is a musical sprinkled with nerdy inside jokes. For example, part of Read More ›
In last week’s podcast,, “The Chaitin Interview II: Defining Randomness,” Walter Bradley Center director Robert J. Marks interviewed mathematician and computer scientist Gregory Chaitin on his method of describing true randomness:. If no theory is simpler than the data you are trying to explain, then the data is random. They also discussed the work of true randomness but also on how Ray Solomonoff (1926–2009), another algorithmic information theory founder, who pursued the “shortest effective string of information that describes an object.” But now, for a lighter touch, we learn that a musical comedy was made of Fermat’s Last Theorem. https://episodes.castos.com/mindmatters/Mind-Matters-125-Gregory-Chaitin.mp3 This portion begins at 19:24 min. A partial transcript, Show Notes, and Additional Resources follow. Robert J. Marks: If you Read More ›