View source

From APIDesign

You do not have permission to do that, for the following reason:

The action you have requested is limited to users in the group Bureaucrats.

You can view and copy the source of this page:

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.

Return to Turing complete.

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