Talk:Beam

I'm not sure the language is Turing-complete as it is now. At least the current brainfuck loop conversion cannot work: u and n here are comparing beam to store. It's not telling if the current cell is non-zero. It's comparing the current cell's value to the current cell's index in memory array. But at the moment I can't see ways of doing it right; mostly there becomes the problem that store cannot be stored to memory. It will quickly go past 255 whereas cells cannot exceed that. Brainfuck loops could be implemented easily if u and n were like:

u If beam != 0 change direction to up
n if beam != 0 change direction to down

--Keymaker 20:38, 26 February 2012 (UTC)

It seems that I stand corrected about the Turing-completeness of this language. bf2beam has just the kind of clever mechanism that I knew was needed but which didn't occur to me... Good work! --Keymaker 18:02, 27 February 2012 (UTC)