Talk:Surreal FOREVER loop

There are some useful total programming languages. Total means they always terminate. In order that a language implementing forever loops can be Turing complete, it would need to allow TC behaviour only outside (or through) the forever loops. In other words, within the forever loop the code must be able to be proven to terminate, but code outside can do whatever it wants. Another strategy would be to do something like Onoz, and perhaps convert loops that provably simplify to terminating expressions into forever loops while leaving the more complicated ones as normal loops. IFcoltransG (talk) 05:05, 27 April 2020 (UTC)