Talk:GolfScratch

I doubt this is Turing-complete, as the stack cannot access items on the bottom or middle, which is a requirement of being Turing-complete. This seems to be more of a PDA (Push-Down Automata). - FluixMakesEsolangs (talk) 21:38, 1 December 2025 (UTC)

It has both a stack and a counter (the accumulator), which is enough storage. But I suspect it's Turing-incomplete anyway because I don't think its arithmetic is powerful enough to be able to store and retrieve arbitrary amounts of data (although I'm not totally sure on that). --ais523 21:46, 1 December 2025 (UTC)