Solving satisfiability by Bayesian inference
Computational Complexity
2020-02-05 v5
Abstract
We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by solving the 3-SAT problem in polynomial time. Beyond this, Bayesian inference could be the background of artificial neural network theory.
Cite
@article{arxiv.1205.6658,
title = {Solving satisfiability by Bayesian inference},
author = {Michel Feldmann},
journal= {arXiv preprint arXiv:1205.6658},
year = {2020}
}
Comments
This version V5: Editorial revisions. 11 pages, no figure. (Initial title:From classical versus quantum algorithms to P versus NP). Additional comments on relations with quantum computing in arXiv: 1312.7551