Complexity and Copmutability

[Simpleton]

Some problems may be impossible to solve by efficient algorithms; and some problems may be impossible to solve algorithmically at all.

The problem is knowing when to stop.

Computer Science is based on a system of 0s and 1s. On or off. There is, therefore, no stopping point.