News for hackers. Stuff that matters.

A comment on Proving the Turing Completeness of Fonts.

Re:Proving the Turing Completeness of Fonts by ericsoderstrom on Monday March 11, 2019 @09:17PM (#19364529)
Isn't basically every moderately expressive system Turing complete? Even the Magic the Gathering card game is turing complete

https://www.toothycat.net/~hologram/Turing/HowItWorks.html

[ Parent | on HN ]
Re:Proving the Turing Completeness of Fonts by zwkrt on Monday March 11, 2019 @10:57PM (#19364960)
That doesn't make it any less fun to find out /how/ they are Turing complete!
[ Parent | on HN ]