Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
There's more than one way to do things
 
PerlMonks  

Re: Jaron Lanier is a Schmuck

by Adam (Vicar)
on Dec 14, 2000 at 23:14 UTC ( #46673=note: print w/ replies, xml ) Need Help??


in reply to Jaron Lanier is a Schmuck

I'm sorry, but your statement:

Thirty years ago, the idea of NP-completeness had not been invented. Nobody had the slightest idea that some problems were intrinsically hard. Nobody had even seriously thought that it might be possible for a problem to be intrinsically hard.
Is just plain wrong. P/NP discussion is almost 100 years old and comes out of Mathematical Logic. The halting problem is older then computers... unless you count a Turing Machine.

Church, Turing, Hilbert, Frege, Goedel... those guys were working on this stuff when light bulbs were still a novel idea.


Comment on Re: Jaron Lanier is a Schmuck

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://46673]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2014-04-21 00:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (489 votes), past polls