cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1994-07-27 - Re: GUT and NP

Header Data

From: jamesd@netcom.com (James A. Donald)
To: rjc@access.digex.net (Ray Cromwell)
Message Hash: b7f93532cdccbdf8656762cdff98ae7f850a49cc31f68359e0efac1738ff2e46
Message ID: <199407272257.PAA20579@netcom8.netcom.com>
Reply To: <199407270329.AA19374@access3.digex.net>
UTC Datetime: 1994-07-27 22:57:27 UTC
Raw Date: Wed, 27 Jul 94 15:57:27 PDT

Raw message

From: jamesd@netcom.com (James A. Donald)
Date: Wed, 27 Jul 94 15:57:27 PDT
To: rjc@access.digex.net (Ray Cromwell)
Subject: Re: GUT and NP
In-Reply-To: <199407270329.AA19374@access3.digex.net>
Message-ID: <199407272257.PAA20579@netcom8.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain


Ray Cromwell writes
>   And regardless of whether quantum computers work or not, they are
> still algorithmic if they can be simulated (however slowly) by
> a turing machine. It's a rigorous mathematical definition.

This is flagrantly false.  A frog can be simulated, give infinite
time and infinite tape size, but a frog is not an algorithm.

Thread