Follow Slashdot blog updates by subscribing to our blog RSS feed

 



Forgot your password?
typodupeerror

Comment Re:Am I Confused? (Score 2) 700

NP: set of problems you can solve in polynomial time on a non-deterministic Turing Machine
P: ...on a deterministic TM

Any problem in NP can be reduced to an NP-Complete problem (clique, vertex cover, 3-SAT, etc...) in polynomial time.

So, if you have an algorithm to solve an NP-Complete (like 3-SAT) problem in p(n) on a deterministic Turing Machine then you have NP == P.

Software

Submission + - What's The Greatest Web Software Ever?

An anonymous reader writes: What's The Greatest Web Software Ever Written?, Charlie Babcock of InformationWeek asks, in his follow up to last year's widely read list of greatest software period. (The winner then was BSD 4.3.) The new Top 12 list is a little funky in that it doesn't distinquish between apps, sites, and controls — XMLHttpRequest object set — is one of the winners. It includes many of the usual suspects, like Digg and AIM, along with some unexpected winners (World of Warcraft, really?). The number one choice, Apache server, is arguably correct. Do you agree with Babcock's list, and what do you think he forgot?

Slashdot Top Deals

Behind every great computer sits a skinny little geek.

Working...