*BlooP is a non-Turing-complete programming language whose main control flow structure is a bounded loop (i.e. recursion is not permitted). All programs in the language must terminate, and this language can only express primitive recursive functions.*

*FlooP is identical to BlooP except that it supports unbounded loops; it is a Turing-complete language and can express all computable functions.*

*BlooP and FlooP can be regarded as models of computation, and have sometimes been used in teaching computability.*

BlooP and Floop. Todays random finding of the day.