This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
An algorithm that could be implemented at a molecular level for solving the satisfiability of Boolean expressions is presented. This algorithm, based on properties of specific sets of natural numbers, does not require an extraction phase for the read out of the solution.
Pierluigi Frisco, Christiaan Henkel, Szabolcs Teng