Turing complete

From APIDesign

Revision as of 07:51, 9 March 2018 by JaroslavTulach (Talk | contribs)

(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)

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.

Retrieved from "http://wiki.apidesign.org/wiki/Turing_complete"