One of the most popular terms when working around programming language creation is the concept of Turing completeness.
In simple terms, to be called “Turing complete”, a given language must have the ability to do anything that a Turing machine can do.
Basically, a very large amount of modern programming languages are Turing complete. They’re all able to run any kind of program and solve any computation problems that a Turing machine can run given enough time and memory.
Links :
- Turing completeness - Wikipedia
- What is Turing complete? - Stackoverflow
- Is CSS Turing complete? (tl;dr : people don’t agree, see why) - Stackoverflow
- Turing complete - Computerphile
- JavaScript is Turing complete - freeCodeCamp
- The Annotated Turing : A guided tour through Alan Turing’s historic paper on computability and the Turing machine - Charles Petzold (book)
- Rule 110 - Wikipedia
- Halting problem