From Esolang
Jump to navigation Jump to search

I would like someone to test if this language is Turing Complete or find out what computional class it is in. Thanks. --Voxel 23:31, 20 March 2009 (UTC)

It's a bounded-storage machine (and therefore sub-TC). You have arbitrary effect at an arbitrary point (pretty trivially), no limit on control flow complexity, but you only have a finite amount of memory in any given program. --ais523 11:06, 26 March 2009 (UTC)
Wait, ignoring the total 1kb ram restriction, who's saying the registers are otherwise bounded? It could be as powerful as a Minsky machine. --Ørjan 13:17, 26 March 2009 (UTC)
Erm, and it also has an addressable memory. --Ørjan 13:20, 26 March 2009 (UTC)
I would tend to take the claim that registers "hold an integer" on face value -- a mathematical integer, without bounds, approximated in the implementation with a machine "integer" of some size. So yeah, a Minsky machine reduction is very likely possible. Chris Pressey (talk) 18:08, 30 October 2012 (UTC)

What would happen if I made it so the memory is unbounded? I only made it have 1kb because the language that I built the first interpreter for had a max array size of 32000 and I didn't see it as needed at the time. --Voxel 21:57, 27 March 2009 (UTC)

The "q" command is present twice in the C++ implementation. The author didn't use "else if", so I think there will be a bug. Maxdefolsch (talk) 14:35, 30 October 2012 (UTC)

Why is it that all of the boolean operations (not, and, or, xor) are logical and not bitwise? I could understand having both, but it seems like bitwise operations would make so much more sense with the limited instruction set, especially considering that logical operations can easily be implemented in very few instructions anyway. PAndaContron (talk) 18:09, 27 October 2019 (UTC)