| Next | Topology of Data Types | 21 |
| Compact set | = | Set that can be exhaustively searched |
“X can be exhaustively searched” (“exhausted”) here means the following:
Given any total predicate p,
we can semidecide ∀x∊X. p(x)
Certainly this is true for finite sets, so finite implies compact
For infinite sets, it's rather surprising
| Next |