Talk:Burnolang

I dont really understand this language. but if it cannot loop, it cannot be turing complete. Just wanted to say(because by your DOOM question it seems like it cant) --Yayimhere2(school) (talk) 09:16, 16 January 2026 (UTC)

( after reading the scratch code I can confirm im pretty dang sure its total --Yayimhere2(school) (talk) 09:22, 16 January 2026 (UTC) )

hmmmmm... ok but if we give it enough iterations maybe it can simulate an loop (example: if we increase a in a%7 8 times, we get back to 1). Conways game of life also uses iterations but it is also turing complete. We need example programs (allowing you to edit the page) and this feels like Malbolge 2 Mrtli08 (talk) 09:37, 16 January 2026 (UTC)

Note that loops need to be able to be infinite. Infinitely long that is. --Yayimhere2(school) (talk) 09:38, 16 January 2026 (UTC)

ok this is like an FSA but we can set its runtime as big as we want (scratch accepts "repeat (Infinity)" MUHAHAHAHAHA) and we firstly need math and spesifically the modulo operation itself thats our backboneMrtli08 (talk) 09:42, 16 January 2026 (UTC)

There also doesnt really seem to be any permanent memory --Yayimhere2(school) (talk) 09:47, 16 January 2026 (UTC)

hmmmmm... this must be leaved in da trash i think until someone returns