To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)

Focusing on the precise grounds on which a person can be said to have solved a problem, six conditions are articulated which govern the application of the concept and its relationship to trying and intention. The "solving" concept is found in synonymous phrases such as "figuring out" and "finding the solution." (Author/CM)