Talk:RUBE

Should this language be in a category named Bully automata? --Aardwolf 23:10, 8 Sep 2005 (GMT)

Turing-complete? "In particular, it has never to the author's knowledge been shown that RUBE is Turing-complete." —Chris Pressey, 2010. —ehird 06:05, 11 August 2011 (UTC)
 * I have a Turing-completeness proof in Rubicon (a BCT interpreter; it needs one bit of the program to repeat infinitely into the distance to give an unbounded queue, though). I'm not sure offhand whether it'd also work in vanilla RUBE. --ais523 07:18, 11 August 2011 (UTC)
 * Well, I suspect Rubicon Is Not RUBE in a couple of ways (RUBE is pretty much defined by its reference interpreter (as its spec is rather lacking) and its reference interpreter is rather... spaghetti.) But, to be precise, RUBE's playfield is unbounded, but RUBE programs are finite.  All in all, the statement on the page should probably be rather more heavily qualified. Chris Pressey (talk) 17:16, 10 September 2012 (UTC)