sdifox
No Lifer
- Sep 30, 2005
- 99,418
- 17,569
- 126
Originally posted by: Kyteland
Originally posted by: sdifox
Originally posted by: dinkumthinkum
Originally posted by: sdifox
P and NP. There are problems that can not be solved efficiently. Those are known as NP (not possible) problems.
Eeek!! Way off dude. Did you ever read those links yourself?
P stands for Polynomial-time. This means there is an algorithm on a Deterministic Turing Machine which worst-case solves the problem in polynomial time, if the problem is in P.
NP stands for Non-deterministic Polynomial time. This means there is an algorithm on a NON-deterministic Turing Machine which worst-case solves the problem in POLYNOMIAL time, if the problem is in NP.
And before you jump in with further misconceptions: a NON-deterministic Turing Machine can -- in parallel -- consider many solutions simultaneously and only output the one which gets the acceptance result. Needless to say, no one has managed to create a "real" non-deterministic Turing Machine. It has NOTHING to do with random numbers.
Another way of characterizing NP is that it is the problems which have polynomial-size PROOFS for a given input that they accept it. This is easy to see: simply generate ALL polynomial-size proofs for a given input and use a non-deterministic Turing Machine to check every one in parallel, in polynomial time.
Generally problems outside of P are considered "intractable" which is just a shorthand way of saying that they may take too much time to be practical. But even problems outside of P may have average-case polynomial-time algorithms which are quite useful: Hindley-Milner type inference and checking is a good example. It is PSPACE-complete in its simplest form, but average case is linear time.
The set of NP-hard problems are those problems for which it is the case that every problem in NP can be reduced to them. The NP-complete problems are NP-hard AND also in NP themselves.
And P, NP are just the first two levels of the polynomial hierarchy, which is all part of PSPACE, which is part of Turing-computable. Then there's a whole arithmetic hierarchy of undecidable problems, which no computer will ever be able solve.
So yea...
lol, he was asking about whether there are problems that current computers can't compute and I pointed him to p-np. What is the problem? Once he gets that, he'll get what he is asking.
I think he was referring to the bolded part.![]()
ok... so I missed a few words