DocumentCode
3113209
Title
Infinite sets that admit fast exhaustive search
Author
Escardó, Martín
Author_Institution
Univ. of Birmingham, Birmingham
fYear
2007
fDate
10-14 July 2007
Firstpage
443
Lastpage
452
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
search problems; set theory; fast exhaustive search; infinite sets; Accidents; Computer science; Topology; Haskell; Higher-type computability and complexity; Kleene-Kreisel functionals; PCF; topology.;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on
Conference_Location
Wroclaw
ISSN
1043-6871
Print_ISBN
0-7695-2908-9
Type
conf
DOI
10.1109/LICS.2007.25
Filename
4276587
Link To Document