|
|
|
|
|
|
by terminalbraid
203 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 |
|
|