[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <402E21BC.7070100@gmx.net>
From: besh at gmx.net (Benjamin Schweizer)
Subject: Re: Removing FIred admins
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Valdis.Kletnieks@...edu wrote:
| For it to be Turing-*incomplete* there have to be almost no
| programs that it can run. Basically, if it has enough smarts to
| run a simulator of a Turing Machine, it's Turing-complete - and all
| you need for THAT is a decrement instruction, a 'test and skip next
| 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.
cu
- --
"Men can only be happy when they do not assume that the object of life
is happiness." --George Orwell
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (GNU/Linux)
Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org
iD8DBQFALiG74Lmwv7NFcKMRAikHAJ941J/mQnriJujtcH/j+DNUL7Lt9wCgozK+
WGv1dap93zBXzpa0GoB8J8o=
=0qrX
-----END PGP SIGNATURE-----
Powered by blists - more mailing lists