A Real World Mechanism for Testing Satisfiability in Polynomial Time

Details A Real World Mechanism for Testing Satisfiability in Polynomial Time A Real World Mechanism for Testing Satisfiability in Polynomial Time

2010-01-19

arxiv.org/abs/1001.3263v1

Computer Science

Logic in Computer Science

Scientific paper

Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the blueprint for a machine which is able to test any formula in conjunctive normal form (CNF) for satisfiability in linear time. The device uses light and some electrochemical properties to function. It adapts itself to the scope of the problem without growing exponentially in mass with the size of the formula. It requires infinite precision in its components instead.

Affiliated with

Also associated with

No associations

Rating

A Real World Mechanism for Testing Satisfiability in Polynomial Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Real World Mechanism for Testing Satisfiability in Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Real World Mechanism for Testing Satisfiability in Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636133