Next: Decidable Doesn't Mean Solved
Up: Trivial Decidability
Previous: Trivial Decidability
One consequence of the previous statement is that all problems with a
single instance are trivially decidable -- a language with one string
is always recursive.
root
6/10/1998