Mind Matters Natural and Artificial Intelligence News and Analysis

Tagpolynomial time algorithm

Human brain digital illustration. Electrical activity, flashes and lightning on a blue background.

An Alternative to the Tractable Cognition Thesis

The Tractable Cognition Thesis presents us with a gap in the logic when it comes to NP-Complete problems. How can we solve for it?

The Tractable Cognition Thesis is the proposal that all processes in the brain can be modeled by a polynomial time algorithm. This includes situations where the brain solves problems that are within NP-Complete domains. In the latter situation, it is assumed the brain is only solving a subset of the NP-Complete domain where the problems can be solved with a polynomial time algorithm. With these assumptions in place, the overall implication is that there is a specific polynomial time algorithm that can emulate every process in the brain. However, there is a gap in the logic when it comes to NP-Complete problems. It is well known that humans solve many problems that are in the general case NP-Complete. Route planning,…