Turing Complete: Ability of a computing system to simulate Turing machines
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 like a Turing machine. It is also called computationally universal.
Most modern programming languages are Turing-complete.
There are languages that are used to classify and describe the contents of documents. 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 article uses material from the Wikipedia Simple English article Turing complete, which is released under the Creative Commons Attribution-ShareAlike 3.0 license ("CC BY-SA 3.0"); additional terms may apply (view authors). Content is available under CC BY-SA 4.0 unless otherwise noted. Images, videos and audio are available under their respective licenses.
®Wikipedia is a registered trademark of the Wiki Foundation, Inc. Wiki Simple English (DUHOCTRUNGQUOC.VN) is an independent company and has no affiliation with Wiki Foundation.