Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a223dd594b1fa0ea

Jump to content

Talk:LOOP (programming language)

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 5 years ago by 2601:C0:C67F:D187:B3CB:4E9D:EEF2:D6F0

I find it a bit strange to list Uwe Schoening as the sole "inventor" of LOOP programs, especially because the first book from him which mentions this is from 2001. Albert Meyer and Dennis Ritchie wrote a paper on Loop programs, "The complexity of loop programs" in 1967 and used pretty much exactly the syntax that Schoening does in his book. 2001:620:8:3E82:8000:0:0:13D4 (talk) 14:36, 3 January 2013 (UTC)Reply

Initially all variables are set to 0, and the examples rely on this. For instance, the program which assigns xj := xi relies on the fact that initiall xj is 0. This is an invalid assumption if the program is used somewhere in the middle of another program, where xj had been previously used. To give a concrete example, if we naively translate the program

 x2 := x1 ;
 x2 := x1

we will get x2 equal to x1 + x1. I think other examples also need such initializations. AndrejBauer (talk) 07:43, 30 April 2020 (UTC)Reply

I thought of the same thing as the LOOP programming language the day before I read this, although with a different syntax. I suppose so did Schoening and Meyer and Ritchie, different people have the same idea. The difference is that Schoening used the same syntax as Meyer and Ritchie, while I used a different syntax instead. --Zzo38 (talk) 04:33, 9 May 2020 (UTC)Reply

Is this programming language turing complete?  Preceding unsigned comment added by Bedorlan (talkcontribs) 23:49, 28 May 2020 (UTC)Reply

No; LOOP programs always halt, and programs that necessarily always halt are not Turing complete. --Zzo38 (talk) 02:57, 11 August 2020 (UTC)Reply

bro the citations are in german.  Preceding unsigned comment added by 2601:C0:C67F:D187:B3CB:4E9D:EEF2:D6F0 (talk) 00:25, 7 April 2021 (UTC)Reply