Talk:B^2

Is this an esoteric language? Looking at the goals and claims about efficiency, maybe the language doesn't really belong here? Also, maybe I'm getting something wrong, but how can a programming language with bounded storage be Turing-complete? --kspalaiologos (talk) 18:44, 24 May 2020 (UTC)

It is not Turing-complete, but a bounded-storage machine. See the counter-argument on this page for details. PythonshellDebugwindow (talk) 15:10, 25 May 2020 (UTC)