Re: computationalism and supervenience

From: Russell Standish <r.standish.domain.name.hidden>
Date: Sun, 27 Aug 2006 20:43:37 +1000

Bruno wrote...

>
> > KURTZ S. A., 1983, On the Random Oracle Hypothesis, Information and
> > Control, 57, pp. 40-47.
> >

I recall reading this paper, and the followup entitled "The Random
Oracle Hypothesis is False" by Chang et al.

>From recollection though, the claim was of superior algorithmic
performance (ie solving NP problems in P time) rather than solving
uncomputable problems.

Cheers

-- 
*PS: A number of people ask me about the attachment to my email, which
is of type "application/pgp-signature". Don't worry, it is not a
virus. It is an electronic signature, that may be used to verify this
email came from me if you have PGP or GPG installed. Otherwise, you
may safely ignore this attachment.
----------------------------------------------------------------------------
A/Prof Russell Standish                  Phone 8308 3119 (mobile)
Mathematics                         	       0425 253119 (")
UNSW SYDNEY 2052         	         R.Standish.domain.name.hidden             
Australia                                http://parallel.hpc.unsw.edu.au/rks
            International prefix  +612, Interstate prefix 02
----------------------------------------------------------------------------
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at http://groups.google.com/group/everything-list
-~----------~----~----~----~------~----~------~--~---

Received on Mon Aug 28 2006 - 02:20:41 PDT