Connectionist networks with symmetric weights (like Hopfield networks and Boltzmann Machines) use gradient descent to find a minimum for quadratic energy functions We show equivalence between the problem of satisfiability in propositional calculus and the problem of minimizing those energy functions