A system is Turing complete if it can be used to simulate any Turing Machine.
Examples of Turing complete systems
- Some cellular automata
- Most Programming languages
- Lambda calculus
- Combinatory logic
- Others like Post-Turing Machines, formal grammar, formal language, etc.
- Some games (Minecraft, baba is you) and computational languages (markup languages like HTML+CSS)
- Other suprisingly turing complete systems that show that after a certain level of complexity it becomes possible to “stumble upon” turing completeness.