ConwayLife.com

What is the cutting edge of universal computers in the GoL community?

I'm aware of of Paul Chapman's (awesome) computer based on Minsky Register Machines:
http://www.igblan.free-online.co.uk/igblan/ca/
and Paul Rendell's (awesome) universal turing machine:
http://rendell-attic.org/gol/tm.htm

Are there others that are smaller, faster or more programmable?
For example, is there currently a universal computer based on an extensible delay line?

Lawrence S. Moss uses a tiny language named "1#" of "text register machines" that is identical to Minsky Register Machines, but with registers replaced by queues of bits. It seems to be moderately efficient and programmable.

Thanks.

The fastest universal computer is Paul Rendell's, at O(n). That's shortly followed by my multi-tape Turing machines at O(n^2), which are easier to program. Lagging behind a long way is Paul Chapman's MRM, at O(exp(n)).

Thank you very much!

For anyone who might happen on this conversation, this is Calcyman's n^2 computer-constructor:
http://www.conwaylife.com/wiki/Spartan_ ... onstructor

There's an article (linked from the wiki) about it here: http://pentadecathlon.com/lifeNews/2009/08/post.html

The article in turn links to an archive, including a tantalizing manual and schematic here:: http://cranemtn.com/life/files/universal-CC.zip