“Infinite Sets That Admit Fast Exhaustive Search”, 2007-07-10 ():
[Twitter] Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time.
We investigate 3 related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive search over infinite sets be performed?
[Keywords: Higher-type computability and complexity, Kleene-Kreisel functionals, PCF, Haskell, topology]