  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.

Computational Complexity