'. '

Turing complete

From APIDesign

Jump to: navigation, search

A language is wikipedia:Turing complete when it can compute a generic computation. Supporting just If and for (with bounded number of repetitions) isn't enough. To be Turing complete the language needs a way to express an indefinite cycle - e.g. either by offering while statement or by supporting recursive invocation of its functions.

Personal tools