I think it is possible some of this can be approached with what is referred to as *higher-type computing*, where higher-type computing is about - *the characterization of the sets that can be exhaustively searched  by an algorithm, in the sense of Turing, in finite time, as those that are topologically compact* - *infinite sets that can be completely inspected in finite time in an algorithmic way, which perhaps defies intuition*  Exhaustible sets in higher-type computation https://arxiv.org/abs/0808.0441  A Haskell monad for infinite search in finite time http://math.andrej.com/2008/11/21/a-haskell-monad-for-infinite-search-in-finite-time/ from Martin Escardo's page http://www.cs.bham.ac.uk/~mhe/ - pt -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to everything-list+unsubscr...@googlegroups.com. To post to this group, send email to email@example.com. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.