|
|
|
|
|
|
by gbacon
367 days ago
|
|
|
My intuition about the question is related: the set of all Turing machines (algorithms) is countable, but the set of all languages (problems to solve) is uncountable. If you take mathematics to be the bigger, uncountable picture, it’s mostly chaos, but if you limit consideration to algorithms, then it’s mostly order. |
|
|
The set of all problems that can be described by a finite description is countable. Why would we care about the rest of them?