Talk:Bloop

Inspired by False? Huh. I read Douglas Hofstader's book "Godel, Escher, Bach" and he described a fictional programming language he called BlooP for the purposes of demonstrating Godel's proof that turing-complete systems can not give defined answers to all questions (much as truth of the Epidimes sentence, "This statement is false" is undecidible). Anyway, I thought that was where it came from, and the book mentions the variants GlooP (which has unbounded loops) and FlooP (which is purely theoretical, no pseudocode is given for this one because it is thought not to exist).

The code given for BlooP was pretty simple pseudocode, like LOOP AT MOST n TIMES: CELL(0) = CELL(0) + 1 END LOOP 1

Anyway, I'm not sure if that's related, just thought it might be useful. 67.246.122.94 22:46, 8 October 2008 (UTC)
 * Indeed, BlooP/FlooP is pretty well known here, I would imagine; the article is about a different Bloop, as far as I can tell. —ehird 17:32, 21 November 2010 (UTC)