One of the most popular terms when working around [programming language creation](Create%20a%20programming%20language.md) 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](https://www.youtube.com/watch?v=PLVCscCY4xI) 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](https://en.wikipedia.org/wiki/Turing_completeness) * [What is Turing complete? - Stackoverflow](https://stackoverflow.com/questions/7284/what-is-turing-complete) * [Is CSS Turing complete? \(tl;dr : people don't agree, see why\) - Stackoverflow](https://stackoverflow.com/questions/7284/what-is-turing-complete) * [Turing complete - Computerphile](https://www.youtube.com/watch?v=RPQD7-AOjMI) * [JavaScript is Turing complete - freeCodeCamp](https://www.freecodecamp.org/news/javascript-is-turing-complete-explained-41a34287d263/#.6t0b2w66p) * [The Annotated Turing : A guided tour through Alan Turing's historic paper on computability and the Turing machine - Charles Petzold \(book\)](https://www.amazon.com/dp/0470229055) * [Rule 110 - Wikipedia](https://en.wikipedia.org/wiki/Rule_110) * [Halting problem](https://en.wikipedia.org/wiki/Halting_problem)