Jim, I'm sure most people here don't have any difficulty understanding what you are talking about. You seem to lack solid understanding of these basic issues however. Please stop this off-topic discussion, I'm sure you can find somewhere else to discuss computational complexity. Read a good textbook, if you are sincerely interested in these things.
On Jan 20, 2008 9:21 PM, Jim Bromer <[EMAIL PROTECTED]> wrote: > > 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? > > -- Vladimir Nesov mailto:[EMAIL PROTECTED] ----- 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=87921854-b4f42e
