Paper: Infinite sets that admit fast exhaustive search (at LICS 2007)

Authors: Martín H. Escardó

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?

BibTeX

  @InProceedings{Escard-Infinitesetsthatadm,
    author = 	 {Martín H. Escardó},
    title = 	 {Infinite sets that admit fast exhaustive search},
    booktitle =  {Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
    year =	 {2007},
    month =	 {July}, 
    pages =      {443--452},
    location =   {Wroclaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }