no, P will always be a (real) subset of NP.

You can solve all problems in P with a non-deterministic turing machine. You have problems in P, which are not NP-hard.
[ ]

For most (all?) they are proven as np-hard, because they can be used to solve a NP-hard problem with a transformation, which lies in P. But is there any proof, that you can transform any NP-hard problem into any other? If you think of a graph of np-hard problems (i guess most go back via a few hops to 3SAT?), then there may be different connected components, or is there a proof, why the graph is connected?

hmm, and the new one with the new error is then the new reference? Not that it really matters ...

I guess its not easy to sync it with the existing ones. NTP will not do the job ;).

I am talking about firefox updates.

> First time accepted submitter chimeraha (3594169)
Wayne?

just saying

Why? When canonical tries to make an own OS instead of a linux distro, they should not require others to do the work for them.

Why aren't you linking to the blogpost, instead of the article quoting the blogpost?

or adblock them. you can get an expression, which blocks the images, only on collapsed tweets

Yeah. I do not think its a problem with gender, nor a problem with games or kids.
Some games use violence as a game element, you are violent without even knowing the gender of other players.
And you should not let your kid play violent games until a certain age, when they need to decide this themselfes.

transparent updating is another issue. You grant a program the the right to install arbitrary binary code. And in case of firefox on windows, even with administrator rights (chrome gets it better with user privileges, but the interesting data is in your home anyway).

so, what are your alternatives?
- trust paths: good luck with the transitivity
- personal meetings: always the best choice, if your privacy is important
- trusting a central instance. Good luck chosing one.

I know several webinterfaces ... but how do you do it yourself? Do you need to scrape the whole web of trust, until you have all keys on your keyring to do then a search on the graph?

on the other hand ... how often do your contacts look for revocations of your key? Most people do not ever refresh their keyring.