P = NP or P != NP ?

my opinion is that P = NP, [(X)^N] with N very high.

Man, different universities and different countries have different terminology and different symbols. Define your symbols and tell us what you're talking about, then we'll be glad to answer.

>>2
Let N be the measure of data;
P is a class of problems which takes P(N) steps to be solved, where is P is a polinomial function;
NP is a class of problems which takes (K)^N steps to be solved, where K is a constant;
If P = NP, there exist an algorithm such that resolves NP in P(N) steps; otherwise P != NP and doesn't exist such algorithm;
In 1 I meant that if there is such algorithm I guess the most high expoent would be very high

The definition of NP is Non-deterministic Polinomial time, what you said (K^N) is just a (yet unproven) consequence.

>>4
ops! You're true, I learned wrongly ;.;
thanks for the correction ^ ^ could you provide more info?
I'm such shit head

>>5
sure!

P = (deterministic) Polynomial
It means that the solution can be found in polynomial time: P(N)

NP = Non-deterministic Polynomial
It means that the solution can be verified in polynomial time at best.

It is a conjecture (meaning that most scientists believe it's true but it has not been mathematically proved yet) that NP problems cannot be P, that is, problems that require P(N) to be verified cannot be solved in P(N) too (and thus require K^N, which is impractical for real-world problems.)

What would Turing answer?

I have no idea what the hell any of you are talking about. You must have never been to college or are all stupid and inferior or something.

>>8
>I have no idea what the hell any of you are talking about. I must have never been to college or I'm stupid and inferior or something.

fixed