Infinite sets that admit fast exhaustive search (2007)
| Venue: | In Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science |
| Citations: | 11 - 6 self |
BibTeX
@INPROCEEDINGS{Escardó07infinitesets,
author = {Martín Escardó},
title = {Infinite sets that admit fast exhaustive search},
booktitle = {In Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science},
year = {2007},
pages = {443--452},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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? Keywords. Higher-type computability and complexity, Kleene–Kreisel functionals, PCF, Haskell, topology. 1.
