The Turing Completeness of Tutankhamun

Earliest known poster for The Turing Completeness of Tutankhamun.

The Turing Completeness of Tutankhamun is a made-for-television movie which explores the question: was the Pharaoh Tutankhamun Turing complete? And if so, can we make valid computations today based on Tutankhamun's grave goods?

In the News

• 

  A Few Good Algorithms is a 1992 American legal computational complexity drama film directed by Rob Reiner, starring Tom Cruise, Jack Nicholson, Demi Moore, Kevin Bacon, and Andrey Kolmogorov.

• 

  Turing Completeness Adventure Stories— "Chilling and informative tales of Turing Machines — rule sets which are able to recognize or decide other data-manipulation rule sets."

• 

  Canopic Snickers is an unlicensed transdimensional corporation which manifests itself as an ancient Egyptian candy bar with alleged life extension properties.

• 

  Evidence emerges that rogue mathematician and alleged time-traveler Anarchimedes is constructing a LEGO-powered doomsday weapon.

Fiction cross-reference

• A Few Good Algorithms
• Anarchimedes
• Canopic Snickers
• Contentment
• Crimes against mathematical constants
• Gnomon algorithm
• Gnomon Chronicles
• Turing Completeness Adventure Stories

Nonfiction cross-reference

• Gnomon Chronicles (nonfiction)

External links

• Turing completeness @ Wikipedia
• Turing machines explained visually @ YouTube
• Trailer - Turing Complete game @ YouTube
• What is the reason for a Turing complete type system @ Stack Overflow

• Tutankhamun @ Wikipedia - (c. 1341 BC – c. 1323 BC), also known as Tutankhaten, was the antepenultimate pharaoh of the Eighteenth Dynasty of ancient Egypt. His death marked the end of the dynasty's royal line.
• The Excavation of Tutankhamun’s Mummy | King Tut in Color @ YouTube

Social media

• Post @ Twitter (6 September 2023)
• Post @ Twitter ()