Comment by terminalbraid
3 days ago
What? You can find tons of textbook examples when dealing with the uncountable sets from non-deterministic finite automata. Those frequently deal with power sets (like when you have an infinite alphabet) which are quintessentially uncountable
No comments yet
Contribute on Hacker News ↗