http://wiki.apidesign.org/index.php?action=history&feed=atom&title=Turing_completeTuring complete - Revision history2026-05-24T17:54:06ZRevision history for this page on the wikiMediaWiki 1.12.0rc1http://wiki.apidesign.org/index.php?title=Turing_complete&diff=9405&oldid=prevJaroslavTulach at 07:52, 9 March 20182018-03-09T07:52:29Z<p></p>
<table style="background-color: white; color:black;">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr>
<td colspan='2' style="background-color: white; color:black;">←Older revision</td>
<td colspan='2' style="background-color: white; color:black;">Revision as of 07:52, 9 March 2018</td>
</tr>
<tr><td colspan="2" class="diff-lineno">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class='diff-marker'>-</td><td style="background: #ffa; color:black; font-size: smaller;"><div>A [[language]] is [[wikipedia:Turing complete]] when it can compute a generic computation. Supporting just <del style="color: red; font-weight: bold; text-decoration: none;">**if** </del>and <del style="color: red; font-weight: bold; text-decoration: none;">**</del>for<del style="color: red; font-weight: bold; text-decoration: none;">** </del>(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 <del style="color: red; font-weight: bold; text-decoration: none;">**</del>while<del style="color: red; font-weight: bold; text-decoration: none;">** </del>statement or by supporting <del style="color: red; font-weight: bold; text-decoration: none;">[[</del>recursive<del style="color: red; font-weight: bold; text-decoration: none;">]] </del>invocation of its functions.</div></td><td class='diff-marker'>+</td><td style="background: #cfc; color:black; font-size: smaller;"><div>A [[language]] is [[wikipedia:Turing complete]] when it can compute a generic computation. Supporting just <ins style="color: red; font-weight: bold; text-decoration: none;">'''If''' </ins>and <ins style="color: red; font-weight: bold; text-decoration: none;">'''</ins>for<ins style="color: red; font-weight: bold; text-decoration: none;">''' </ins>(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 <ins style="color: red; font-weight: bold; text-decoration: none;">'''</ins>while<ins style="color: red; font-weight: bold; text-decoration: none;">''' </ins>statement or by supporting recursive invocation of its functions.</div></td></tr>
</table>JaroslavTulachhttp://wiki.apidesign.org/index.php?title=Turing_complete&diff=9404&oldid=prevJaroslavTulach: 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-09T07:51:47Z<p>New page: A <a href="/wiki/Language" title="Language">language</a> is <a href="http://en.wikipedia.org/wiki/Turing_complete" class="extiw" title="wikipedia:Turing_complete">wikipedia:Turing complete</a> when it can compute a generic computation. Supporting just **if** and **for** (with bounded number of repetitions) isn't enough. To be [[Tur...</p>
<p><b>New page</b></p><div>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.</div>JaroslavTulach