Talk:Random

If anyone has the Python script, could you re-upload it / post it? Thanks

--Orange 03:40, 11 August 2008 (UTC)

Turing completeness
You could propably implement bitwise Cycling tag in Random to prove its turing completeness

131.234.240.105 10:41, 16 June 2010 (UTC)


 * I have a hunch something like compiling Boolfuck (minus I/O) into Random might be easier, actually. It has a very Boolfuck/Brainfuck like loop, and if you have a layout something like

half of data - currently running code - other half of data
 * then it looks easier to me for the running code to use the data as a tape (i.e. two stacks) than as a queue, since it seems hard to pass through the code part. Hm also you cannot delete stuff without printing it, although that is not actually important for TC-ness, I think.  --Ørjan 13:02, 16 June 2010 (UTC)