Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://46673]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (2)
As of 2017-06-28 15:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (640 votes). Check out past polls.