User talk:Stkptr

StackBBQ

Alright. Help me rewrite it. --_i__s__l__p__t__n__g_ 04:59, 7 March 2025 (UTC)

My main concern was with the 000 special command, since the summary and interpreter disagree. I have made an edit to the page StackBBQ which aligns the summary with the behavior of the interpreter listed on the page. Feel free to correct it. stkptr (talk) 07:07, 7 March 2025 (UTC)

Will you help me to build StackBBQ 2 that is Turing-Complete? --_i__s__l__p__t__n__g_ 02:58, 11 March 2025 (UTC)

I'm not entirely sure what exactly would be necessary. Some type of primitive loop would be required. To keep the spirit of the language, a for style loop would likely be best since they only execute a fixed amount of times. It would still require the programmer to make a quine to loop indefinitely, but would allow for a program to execute more than one operation per instruction. On the Esolangs community Discord someone joked about a "four" loop, presumably it would always iterate exactly 4 times, but that could honestly be enough assuming it could nest. Maybe the 011 command could be replaced with some sort of loop marking construct? Note that I'm not the ideal person to ask for this since I am relatively unfamiliar with creating quines, and am rather uninspired when creating languages. I hope this can serve as some base inspiration. stkptr (talk) 05:02, 11 March 2025 (UTC)

StackBBQ2

Thanks

thank you for add the turing complete proof of MSFE++! Thank you very much! --User:Cycwin