a bricolage of popomo floatsam

Why can't I get to do something fun, and get paid to do it. By the way Eric Winfree's a really nice guy, and I commend him for publishing this in an open journal. Give it a read, it's a cool paper.

comment by
collin on
05.04.12 at 15:11

I forgot to mention that this paper shows (some how) that Eric's method is Turing Universal.

comment by
ben on
05.04.12 at 15:15

What's the difference between Turing Complete and Turing Universal?

comment by
collin on
05.04.12 at 16:32

This says that "a programming language or any other logical system is called Turing-complete if it has a computational power equivalent to a universal Turing machine." So, though I may be wrong, they mean the same thing. I just pulled the phrase out of the abstract. I allways thought "turing complete" meant the language/system was equivalent to a turing machine with a finite tape, "universal" one with an infinte tape, but I guess I'm wrong.