GUT and P=NP

[Mike McNally]

> How about any process where the state and the change
> between one state and another state can be described
> tolerably simply in some language that is not explicitly
> algorithmic, but which is enormously difficult, complex,
> and expensive to describe in explicitly algorithmic
> language, for example water pouring through a channel?

So are you suggesting that the definition of "algorithm" has
an "as long as it's not too hard" clause?