Talk:TwoStep

Well, I doubt this language is Turing-complete, as there doesn't seem to be a way to make large nested loops. Also, what happens when you try to divide 5 by 2, or something like that? --Ihope127 21:31, 22 Aug 2006 (UTC)


 * Nested loops? The only loops you can write are one statement long, something like XX)0, where XX is any statement and its digit. Can't even write a proper cat program, the example provided just copies a single character from input to output (and I can't see how to copy an arbitrary amount of text without being able to have a loop over two statements).
 * Maybe the language could be improved by changing the meaning of >, <, ) and (, to skip the number of statements corresponding to the content of memory if the condition is not satisfied. Then the following cat program will copy characters until a zero is found: *0*0:::*0*0]0[0)0.0 (where the ::: indicates that there are 256 consecutive *0).
 * As for Turing-completeness, with exactly one byte of memory you aren't going to be able to do much...

I know it can't do much, but TwoStep is my first attempt at an esoteric programming language. Another reason it can't do much is because I wanted to be able to write an interpreter for it, which I was able to do. It lacks a lot in a lot of places, and I plan to write a better language. Thanks for the comments. --Macgeek 07:14, 23 Aug 2006 (UTC)


 * If the loops are extended to multiple statements, and the memory is allowed to be unbounded, that's quite close to TC-ness (missing only a second memory or the divide-or-jump operator used by multiplicative Minsky machines). ais523 15:04, 24 Aug 2006 (UTC)