Mind-blowing! These Unexpected Things Are Turing-Complete!

2025-04-27

From C++ templates to Magic: The Gathering, even PowerPoint—this article reveals a surprising array of seemingly simple systems that are, in fact, Turing-complete. The examples range from programming languages and hardware instruction sets to game mechanics and even image compression, showcasing the surprising ubiquity of Turing completeness and its unexpected applications. Some examples even leverage bugs or vulnerabilities to achieve unexpected computational power. Prepare to be amazed!

Read more
Development

Five Levels of Configuration Languages: From Simple Strings to Turing Completeness

2025-04-12

This article explores five levels of configuration languages, ranging from simple file strings to full-fledged programming languages. The author argues that choosing the right level is crucial, advocating for the lowest possible level to maintain simplicity and avoid over-engineering. Each level's characteristics, advantages, disadvantages, and potential problems (like circular dependencies) are illustrated with real-world examples. The article concludes by recommending a judicious choice for different scenarios, preventing unnecessary complexity.

Read more