** Next:** Decidability Theorems
** Up:** Decidable Doesn't Mean Solved
** Previous:** e.g. Fermat's conjecture

The above
example points out that just because a problem is decidable doesn't
mean that we know which algorithm will decide it *correctly* ,
only that such an algorithm exists.

*root*

*6/10/1998*