Talk:ByteByteJump

From Esolang
Jump to: navigation, search

Very nice --Oleg 07:19, 13 October 2010 (UTC)

Thanks! I'll return the compliment and say: nice work on BitBitJump! =) --Javamannen 18:43, 13 October 2010 (UTC)

Can this be TC ?

If the values A,B,C and memory hold bignums does this become a Turing complete machine ? Rdebath (talk) 10:38, 28 August 2013‎ (UTC)

Not with a finite program. You can never get to values or cell addresses that are not in the original program.
With an infinite program setup, maybe. --Ørjan (talk) 13:15, 28 August 2013 (UTC)
Okay, makes sense no adder so no way of doing the BF(+[>+]), however, I suppose adding an inc/dec pair of magic memory locations would be (just) enough to change that. (by inc/dec I mean put a value in "X" and value+1 codes out of "Y" put value in "Y" and value-1 codes out of "X".) Rdebath (talk) 16:46, 28 August 2013 (UTC)