cryptoanarchy.wiki

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

1994-07-24 - Re: GUT and P=NP

Header Data

From: m5@vail.tivoli.com (Mike McNally)
To: jamesd@netcom.com (James A. Donald)
Message Hash: 3c5a4c432c154bacb7b35ea6277538addaca6e748d14b55ee9b36e7fa2ee1c66
Message ID: <9407241343.AA03758@vail.tivoli.com>
Reply To: <199407240028.RAA12119@netcom7.netcom.com>
UTC Datetime: 1994-07-24 13:43:23 UTC
Raw Date: Sun, 24 Jul 94 06:43:23 PDT

Raw message

From: m5@vail.tivoli.com (Mike McNally)
Date: Sun, 24 Jul 94 06:43:23 PDT
To: jamesd@netcom.com (James A. Donald)
Subject: Re: GUT and P=NP
In-Reply-To: <199407240028.RAA12119@netcom7.netcom.com>
Message-ID: <9407241343.AA03758@vail.tivoli.com>
MIME-Version: 1.0
Content-Type: text/plain


> How about any process where the state and the change
> between one state and another state can be described
> tolerably simply in some language that is not explicitly
> algorithmic, but which is enormously difficult, complex,
> and expensive to describe in explicitly algorithmic
> language, for example water pouring through a channel?

So are you suggesting that the definition of "algorithm" has
an "as long as it's not too hard" clause?

Thread