# Turing complete

## ability of a computing system to simulate Turing machines / From Wikipedia, the free encyclopedia

**Turing complete** is a term used in computability theory to describe abstract machines. These are usually called automata. An automaton is Turing complete if it can be used to emulate a Turing machine. It is also called **computationally universal.**

Most modern programming languages are Turing-complete.

However, there are languages that are used to classify and describe the contents of document. An example is HTML. HTML is not Turing complete, because it cannot actively change the state of the system. HTML can be combined with a technology such as JavaScript. Using HTML and JavaScript together can make a Turing complete system.

The standard regular expressions, which most programming languages use, are not Turing complete. This is because regular expression engines have been adapted to include back-references, and a finite automaton cannot handle back references.

*This short article about technology can be made longer. You can help Wikipedia by adding to it*.

Oops something went wrong: