lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
Open Source and information security mailing list archives
| ||
|
From: steve.wray at paradise.net.nz (Steve Wray) Subject: Re: Removing FIred admins > [mailto:full-disclosure-admin@...ts.netsys.com] On Behalf Of > Benjamin Schweizer > > Valdis.Kletnieks@...edu 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... :-/
Powered by blists - more mailing lists