Why does a Turing-complete type system make type checking undecidable? https://composition.al/blog/2017/02/27/why-does-a-turing-complete-type-system-make-type-checking-undecidable/ (Java's type checker is Turing complete!)
miniblog.
Related Posts
YAML is a funny language: it's not Turing complete, but it can have arbitrary code execution bugs.
Results from The International Obfuscated C Code Contest are out, and the winner has a devious program using the Turing-completeness of printf! Yikes.
The Turing Test focuses on distinguishing between humans and computers in a text chat.
There are lots of other domains where it's interesting to compare styles. Do we make different mistakes in speech recognition? How easy is it to spot a chess AI masquerading as human?