JaroslavTulach at 07:52, 9 March 2018 - 2018-03-09 07:52:29

←Older revision Revision as of 07:52, 9 March 2018
Line 1: Line 1:
-
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.
+
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.

JaroslavTulach: New 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 [[Tur... - 2018-03-09 07:51:47

New 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 [[Tur...

New 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.