We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:B^2 Turing Completeness
Jump to navigation
Jump to search
...while a Turing machine needs an infinite (or unbounded) amount of storage, B2 isn't Turing complete. And since bounded-storage machines have finite storage, but are the same as Turing machines in all other respects (just like B2), B2 is not Turing-complete but is a bounded-storage machine.
In theory you could create an infinite number of variables and an infinite number of if statements. However, I will add the information provided, removing the words "you" and replacing them with nondeterministic pronouns.