Talk:ZeroStack2D

EXAMPLES

I just hope that some people can write me a hello world, because I don't know how to write programs in this programming language... NeurosamaLover (talk) 05:14, 20 February 2026 (UTC)

DESIGNS

[NOTHING...]

ISSUES

I doubt this is Turing-complete with only one stack (there's also no "conditional jump instruction") —aadenboy (talk|contribs) 16:07, 19 February 2026 (UTC)

 Re: I doubt this is Turing-complete...
 
 I can address this concern about Turing-completeness:
 The language is indeed Turing-complete, and the reasoning is as follows:
 1.  We can simulate two independent counters using only a single stack, through operations like duplication (`:`), swap (`\`), and conditional direction changes (`|`, `_`).
 2.  Minsky's theorem proves that a 2-counter machine (P) is Turing-complete and can simulate a 2-stack automaton.
 3.  Therefore, by transitivity, this language can simulate a 2-stack automaton via a single stack, making it Turing-complete.
 The conditional direction changes (`|`, `_`) act as the necessary conditional jumps, and the stack operations allow us to encode the state needed for arbitrary computation.
 NeurosamaLover (talk) 05:07, 20 February 2026 (UTC)

ah, I see now —aadenboy (talk|contribs) 14:47, 20 February 2026 (UTC)