Re: tortoise algorithms

["RAUBER, JOEL" <JOEL_RAUBER@SDSTATE.EDU>]

John D. in part:

 
> ================================
>
> As a tangent that can be pursued a very long way:
> At the opposite end of the spectrum from Zeno (who
> attacked a trivial problem) we can consider questions
> that are answerable but for which no efficient
> algorithm exists.  Some problems are easy, some
> problems are hard (nonlinear optimization), some
> are provably uncomputable (Turing's halting problem),
> and some are provably undecidable (Gödel).

As an aside, IYHO

Is the four color map proof an example of an answerable problem, albeit with
inefficient algorithm?

Joel R