Chronology | Current Month | Current Thread | Current Date |
[Year List] [Month List (current year)] | [Date Index] [Thread Index] | [Thread Prev] [Thread Next] | [Date Prev] [Date Next] |
================================
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).