Talk:Meander

I have no idea whether or not this language is Turing complete. I think it probably is, but can't be certain.

It's clearly a tarpit, so trying to program an interpreter for a known Turing-complete machine would be an incredibly difficult task.

Does the data pointer advance every instruction like the instruction pointer (presumably) does? Does + wrap around from 255 to 0, like in most byte-sized cell brainfuck implementations?

Assuming it does, it seems to me that this language has only reversible instructions. Might be able to encode a Reversible Brainfuck program into it, as long as its loops are not too deeply nested. --Ørjan (talk) 19:02, 3 March 2014 (UTC)

Ah... I forgot to mention that the data pointer advances every time the value in the cell is incremented. I don't know how that I left that out. I think I need to spend more time proofreading.

The simplest way to increment the value of a cell by an arbitrary amount would involve incrementing a neighboring cell by the same amount. This would be done by incrementing the cell, rotating twice, incrementing, rotating twice... and so on until the desired value is reached.

And yes, values "wrap around" to zero when they exceed the maximum value the cell can hold (I think of it as "clocking over"). Brian-M (talk) 07:49, 4 March 2014 (UTC)