Next | Topology of Data Types | 25 |

Implausible claim: ℕ* is exhaustively searchable

Given any total predicate *p*,

we can semidecide ∀*x* ∊ ℕ*. *p*(*x*)

Happily, ℕ* is very easily modeled in the Haskell programming language

So rather than a proof, we will now have a demonstration