I had no idea what you were talking about until I read Matt Mahoney's remarks. I do not understand why people have so much trouble reading my messages but it is not entirely my fault. I may have misunderstood something that I read, or you may have misinterpreted something that I was saying. Or even both! But if you want to continue this discussion feel free.
Robin said: As for your problem involving SAT, it's not applicable to P-NP because they are classes of decisions problems (http://en.wikipedia.org/wiki/Decision_problem), which means problems that can be answered yes or no. Wikipedia: http://en.wikipedia.org/wiki/Boolean_satisfiability_problem In complexity theory, the Boolean satisfiability problem (SAT) is a decision problem, whose instance is a Boolean expression written using only AND, OR, NOT, variables, and parentheses. The question is: given the expression, is there some assignment of TRUE and FALSE values to the variables that will make the entire expression true? --------------------------------- Never miss a thing. Make Yahoo your homepage. ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=87919780-c5a240
