2 ms·
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 uncoun
by gbacon 1y 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.
- Viliam1234 1y ago> the set of all languages (problems to solve) is uncountable The set of all problems that can be described by a finite description is countable. Why would we care about the rest of them?
- jibal 1y agoBecause we're theorists.