
It is shown that conventional computers can be exponentiallx faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to converge, a stable state of an
arbitrary planar Hopfield network can be found by a conventional computer in polynomial time.