The Turing Completeness of Tutankhamun: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
* [[Canopic Snickers]] | * [[Canopic Snickers]] | ||
* [[Crimes against mathematical constants]] | |||
* [[Gnomon algorithm]] | * [[Gnomon algorithm]] | ||
* [[Gnomon Chronicles]] | * [[Gnomon Chronicles]] | ||
| Line 31: | Line 32: | ||
[[Category:Fiction (nonfiction)]] | [[Category:Fiction (nonfiction)]] | ||
[[Category:Crimes against mathematical constants]] | |||
{{Template:Categories: Turing completenes}} | {{Template:Categories: Turing completenes}} | ||
Revision as of 09:18, 6 September 2023
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
Canopic Snickers is an unlicensed transdimensional corporation which manifests itself as an ancient Egyptian candy bar with alleged life extension properties.
Fiction cross-reference
Nonfiction cross-reference
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 ()