Your perspective is beyond refreshing. Spot on with this post. I am impressed, I have to say. I found your article on my Google feed. Thank you for sharing your info.

So here it goes, a brief summary of what P and NP are.

What is computational complexity ?
Computational complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps does it take to solve a problem) and space (how much memory does it take to solve a problem).

In this theory, the class P consists of all those decision problems that can be solved on a deterministic sequential machine in an amount of time that is polynomial in size of the input.

The class NP consist of all those decision problems whose positive solutions can be verified in polynomial time given the right information or equivalently, whose solution can be found in polynomial time on a non-deterministic machine.

Your perspective is beyond refreshing. Spot on with this post. I am impressed, I have to say. I found your article on my Google feed. Thank you for sharing your info.

You remind me of my neighbor. You have a good head on your shoulders.

You have brought up a very superb points Can you tell us more about this?

When I started my browser this site was running. I simply have to tell you that your blogs are really valuable.

http://en.wikipedia.org/wiki/P=NP

So here it goes, a brief summary of what P and NP are.

What is computational complexity ?

Computational complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps does it take to solve a problem) and space (how much memory does it take to solve a problem).

In this theory, the class P consists of all those decision problems that can be solved on a deterministic sequential machine in an amount of time that is polynomial in size of the input.

The class NP consist of all those decision problems whose positive solutions can be verified in polynomial time given the right information or equivalently, whose solution can be found in polynomial time on a non-deterministic machine.

More info in wiki.

have a glossary of the jargons you use.

what is P and NP in this context?

Gp. It’s supposed to be funny (pun) if you can solve the P=NP problem then you can grab the 1 million dollar prize at Clay Maths institute.

http://www.claymath.org/millennium/P_vs_NP/

okay…was this post supposed to b funny? or….I kno its true.