> [mailto:[EMAIL PROTECTED] On Behalf Of > Benjamin Schweizer > > [EMAIL PROTECTED] wrote: > > | For it to be Turing-*incomplete* there have to be almost no [snip] > | if zero' instruction, and a branch instruction. > > And unlimited memory (tapes). That's one reason why you can't build a > Turing-complete machine irl. As DRM depends on hardware (that can't be > Turing-complete by nature), DRM can't be Turing-complete, too.
Thats why I said it was a bit of a facetious joke. Sorry, list. I'll try to keep my off-color humor to myself in future... :-/ _______________________________________________ Full-Disclosure - We believe in it. Charter: http://lists.netsys.com/full-disclosure-charter.html
