Talk:RCEM

I think, it should be turing-complete. Is that true? --Feuermonster 19:18, 16 March 2008 (UTC)

It is.

What? You want proof? All right then.

We know Smallfuck would be turing-complete if it had infinite memory. RCEM has this, so it is turing-complete as it is possible to translate any Smallfuck program into a RCEM program:

  Smallfuck   RCEM
  >            r1
  <            l1
  *            ++20
  [            {
  ]            }

--Marinus