Infinite sets that admit fast exhaustive search

Authors:
Martin Escardo
Affiliations:
University of Birmingham, UK
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 9

A Functional Algorithm for Exact Real Integration with Invariant Measures

Electronic Notes in Theoretical Computer Science (ENTCS)
Some Programming Languages Suggested by Game Models (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Purely functional lazy non-deterministic programming

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Selection functions, bar recursion and backward induction

Mathematical Structures in Computer Science
What sequential games, the tychonoff theorem and the double-negation shift have in common

Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Computational interpretations of analysis via products of selection functions

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The Peirce translation and the double negation shift

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Purely functional lazy nondeterministic programming

Journal of Functional Programming - Dedicated to ICFP 2009
Shrinking and showing functions: (functional pearl)

Proceedings of the 2012 Haskell Symposium

Quantified Score

Hi-index	0.01

Visualization

Abstract

Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three 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?