Talk:Iterate

would there be a way to prove what computational class Iterate is? not really sure how to go about this I know it isn't a Finite-state automaton simply from this code:

(*)∞<
  *=1< @ > // loops once on the second pass, then twice on the third, three times on the fourth, and so on
           // "", "1", "12", "123", "1234", "12345", ...
  (*1)1< > // increment
>

and it also isn't a Push-down automata... what could it be? —aadenboy (talk|contribs) 17:39, 22 January 2025 (UTC)

Perhaps Iterate can embed flowcharts, allowing something like the wikipedia:structured program theorem to apply. Corbin (talk) 18:03, 22 January 2025 (UTC)

I think I can come up with something with the $# command, but I'm still very interested to see what its computational class is without it, since it still looks like it could be but it's much less clear (at least to me). -PkmnQ (talk) 01:17, 24 January 2025 (UTC)