Full Disclosure mailing list archives
PC/DRM Turing-completness (Re: Removing FIred admins)
From: Martin Mačok <martin.macok () underground cz>
Date: Sat, 14 Feb 2004 23:37:04 +0100
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 _______________________________________________ Full-Disclosure - We believe in it. Charter: http://lists.netsys.com/full-disclosure-charter.html
Current thread:
- Re: Removing FIred admins, (continued)
- Re: Removing FIred admins Paul J. Morris (Feb 13)
- Re: Removing FIred admins gadgeteer (Feb 13)
- RE: Removing FIred admins James Patterson Wicks (Feb 12)
- Re: Removing FIred admins gadgeteer (Feb 12)
- RE: Re: Removing FIred admins Steve Wray (Feb 13)
- RE: Re: Removing FIred admins Michal Zalewski (Feb 13)
- RE: Re: Removing FIred admins Steve Wray (Feb 13)
- Re: Re: Removing FIred admins Valdis . Kletnieks (Feb 13)
- Re: Re: Removing FIred admins Benjamin Schweizer (Feb 14)
- RE: Re: Removing FIred admins Steve Wray (Feb 14)
- PC/DRM Turing-completness (Re: Removing FIred admins) Martin Mačok (Feb 14)
- Re: Removing FIred admins gadgeteer (Feb 12)
- Re: Re: Removing FIred admins Valdis . Kletnieks (Feb 13)
- Re: Removing FIred admins Gerhard den Hollander (Feb 13)
- RE: [inbox] RE: Removing Fired admins Curt Purdy (Feb 13)