Turing completeness

In computability , a of -manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine.

This means that this is able to recognize or decide other -manipulation rule sets.

Turing completeness is used as a way to express the power of such a -manipulation rule set.

Virtually all languages today are Turing-complete.

The is named after mathematician and scientist Alan Turing.

To show that something is Turing-complete, it is enough to show that it can be used to simulate some Turing-complete .

For example, an imperative language is Turing-complete if it has conditional branching and the ability to change an arbitrary amount of memory.

Of course, no can have infinite memory; but if the limitation of finite memory is ignored, most languages are otherwise Turing-complete.

Last Updated on 3 years by pinc