From Esolang
Jump to: navigation, search

I'm pretty sure there is a mathematical proof somewhere that a language can't both be turing-complete and reversible. I might be wrong though. --TehZ 19:29, 14 January 2011 (UTC)

Most definitely wrong. Maybe you are thinking about how a program in a reversible language with finite memory has to halt or return to its original configuration? --Ørjan 09:30, 15 January 2011 (UTC)

I'm going to remove the statement that it's believed to be turing complete. The language would have to be able to store an arbitrary number of variables for that, while this one does most definitely not. Dimitriye98 (talk) 02:26, 22 May 2013 (UTC)

The language definitely has an infinite amount of memory: "There are 2 memory-spaces, which are 2D infinite in all directions" and this memory is accessible --AnotherTest (talk) 11:02, 22 May 2013 (UTC)
Yes, but it can only store 4 values, the language has to be able to store an arbitrary number of DISTINCT variables. Dimitriye98 (talk) 02:46, 24 May 2013 (UTC)
Actually, better way to make the point without changing the actual language of it, it has to be able to store an arbitrary number of VARIABLES, not only be able to store an infinite number of different values. Dimitriye98 (talk) 02:49, 24 May 2013 (UTC)