BlooP, FlooP, and GlooP - Revision history

Dan Tobias at 20:04, 8 June 2019

2019-06-08T20:04:30Z

Dan Tobias: /* Links */

2014-05-06T12:54:08Z

‎Links

Dan Tobias: /* Links */

2014-04-25T04:20:47Z

‎Links

Dan Tobias at 05:37, 14 February 2014

2014-02-14T05:37:35Z

Dan Tobias: /* FlooP */

2013-12-18T14:03:34Z

‎FlooP

Dan Tobias: /* FlooP */

2013-12-18T14:02:45Z

‎FlooP

Dan Tobias: /* BlooP */

2013-12-18T14:01:32Z

‎BlooP

Dan Tobias: /* GlooP */

2013-12-09T12:34:18Z

‎GlooP

Dan Tobias at 12:32, 9 December 2013

2013-12-09T12:32:07Z

Dan Tobias: Created page with "{{FormatInfo |formattype=Languages |subcat=Programming Languages |released=1979 }} '''BlooP, FlooP, and GlooP''' are programming languages introduced for educational purpo..."

2013-12-09T03:05:20Z

Created page with "{{FormatInfo |formattype=Languages |subcat=Programming Languages |released=1979 }} '''BlooP, FlooP, and GlooP''' are programming languages introduced for educational purpo..."

New page

{{FormatInfo
|formattype=Languages
|subcat=Programming Languages
|released=1979
}}
'''[[BlooP, FlooP, and GlooP]]''' are programming languages introduced for educational purposes in chapter XIII of ''Gödel, Escher, Bach: An Eternal Golden Braid'' (ISBN 978-0-465-02656-2, ISBN 0-14-017997-6), by Douglas R. Hofstader. They are defined with strictly limited built-in capabilities in order to explore what sorts of computations are theoretically possible given a particular set of language capabilities.

Each of these languages has only addition and multiplication as built-in functions, so other functions such as subtraction need to be defined in terms of these. Variables can only be natural numbers, integers zero or higher.

== BlooP ==

BlooP supports program loops, but only with a specified maximum number of iterations (as either a constant or a variable, so the bounds can be computed), meaning that all programs are guaranteed to terminate.

== FlooP ==

FlooP has the capabilities of BlooP, but allowing unbounded loops, which exit only when a test is passed, so an infinite loop could occur if the test never passes.

== GlooP ==

GlooP is a hypothetical language that is even more unbounded than Floop, and thus able to compute things that are logically uncomputable in the (Turing-complete) Floop language, but it is believed that no such language is actually possible.

== Links ==
* [[Wikipedia:BlooP and FlooP]]

← Older revision		Revision as of 12:54, 6 May 2014
Line 23:		Line 23:
	* [[Wikipedia:BlooP and FlooP]]		* [[Wikipedia:BlooP and FlooP]]
	* [http://code.google.com/p/bloop/ BlooP/FlooP compiler]		* [http://code.google.com/p/bloop/ BlooP/FlooP compiler]
		+	* [http://abstrusegoose.com/503 Abstruse Goose: BlooP and FlooP and GlooP (comic strip)]

← Older revision		Revision as of 04:20, 25 April 2014
Line 22:		Line 22:
	== Links ==		== Links ==
	* [[Wikipedia:BlooP and FlooP]]		* [[Wikipedia:BlooP and FlooP]]
		+	* [http://code.google.com/p/bloop/ BlooP/FlooP compiler]

@@ Line 4: / Line 4: @@
 |released=1979
 }}
-'''[[BlooP, FlooP, and GlooP]]''' are programming languages introduced for instructional purposes in chapter XIII of ''Gödel, Escher, Bach: An Eternal Golden Braid'' (ISBN 978-0-465-02656-2, ISBN 0-14-017997-6), by Douglas R. Hofstader. They are defined with strictly limited built-in capabilities in order to explore what sorts of computations are theoretically possible given a particular set of language capabilities.
+'''BlooP, FlooP, and GlooP''' are programming languages introduced for instructional purposes in chapter XIII of ''Gödel, Escher, Bach: An Eternal Golden Braid'' (ISBN 978-0-465-02656-2, ISBN 0-14-017997-6), by Douglas R. Hofstader. They are defined with strictly limited built-in capabilities in order to explore what sorts of computations are theoretically possible given a particular set of language capabilities.
 Each of these languages has only addition and multiplication as built-in functions, so other functions such as subtraction need to be defined in terms of these. Variables can only be natural numbers, integers zero or higher.

@@ Line 14: / Line 14: @@
 == FlooP ==
-FlooP has the capabilities of BlooP, but allowing unbounded loops, which exit only when a test is passed, so an infinite loop could occur if the test never passes. Hence, programs do not necessarily terminate. This language can be shown to be Turing-complete, meaning that it can compute anything that any other programming language can do.
+FlooP has the capabilities of BlooP, but allowing unbounded loops, which exit only when a test is passed, so an infinite loop could occur if the test never passes. Hence, programs do not necessarily terminate. This language can be shown to be Turing-complete, meaning that it can compute anything that any other Turing-complete programming language (a category which includes all general-purpose programming languages in actual use) can do.
 == GlooP ==

@@ Line 2: / Line 2: @@
 |formattype=Languages
 |subcat=Programming Languages
 |released=1979
 }}

@@ Line 10: / Line 10: @@
 == BlooP ==
-BlooP supports program loops, but only with a specified maximum number of iterations (as either a constant or a variable, so the bounds can be computed), meaning that all programs are guaranteed to terminate.
+BlooP supports program loops, but only with a specified maximum number of iterations (as either a constant or a variable, so the bounds can be computed; however, this computation must be done before the loop starts, so that the iteration limit can't be changed once the loop starts), meaning that all programs are guaranteed to terminate.
 == FlooP ==

@@ Line 18: / Line 18: @@
 == GlooP ==
-GlooP is a hypothetical language that is even more unbounded than Floop, and thus able to compute things that are logically uncomputable in the (Turing-complete) Floop language, but it is believed that no such language is actually possible.
+GlooP is a hypothetical language that is even more unbounded than FlooP, and thus able to compute things that are logically uncomputable in the (Turing-complete) FlooP language, but it is believed that no such language is actually possible.
 == Links ==
 * [[Wikipedia:BlooP and FlooP]]