Talk:BeerLang

what do you mean ) makes it TC. ill delete that category that's not enough [:Yayimhere (talk) 15:05, 24 September 2024 (UTC):]

The language is underspecified, which makes the computational class hard to work out (also, the difference between % and $ is never explained, with the documentation acting as though they're equivalent). If the expression syntax supports multiplication and floor-division, then the language is Turing-complete even without ) because that would give it all the commands of Blindfolded Arithmetic which is TC. The computational class problem using only the constructs specified on the page (assignment, addition, subtraction, and "jump back to start of block if nonzero") is interesting (I don't know whether those instructions are sufficient) and the proof on the page is definitely insufficient in that case – but my guess is that there's something about the language that makes the ) instruction obviously make it Turing-complete, but that thing simply hasn't been documented on the page. (It's a pity that there's no interpreter and no link to further documentation, either of which would help to clarify what the author had in mind.) --ais523 02:49, 25 September 2024 (UTC)