full-disclosure - PC/DRM Turing-completness (Re: Removing FIred admins)

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

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

From: martin.macok at underground.cz (Martin Mačok)
Subject: PC/DRM Turing-completness (Re: Removing FIred admins)

On Sat, Feb 14, 2004 at 02:25:16PM +0100, Benjamin Schweizer wrote:

> | 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.

You can. You don't have to build an *infinite* tape, *unlimited* is
enough. Buy some tape, execute the instructions and buy a new tape
or make (linear) space compression on demand. This way our PCs can
be Turing-complete.

Martin Ma?ok