Talk:AnnoyStack

This language is not Turing-complete, since programs cannot conditionally halt based on input. LegionMammal978 (talk) 20:17, 15 November 2020 (UTC)

The language actually has no conditionals at all, so the output is always a linear combination of a (possibly infinite, but repeating or repeating with higher character codes) fixed string and the input characters. The "infinite string which repeats with higher character codes each time" is technically something that a finite-state machine can't do, but is fairly useless in practice – so in addition to not being Turing-complete, the language is only barely more powerful than a finite-state machine along one dimension (and less powerful along others). --ais523 02:01, 15 April 2023 (UTC)