Infinite sets that admit fast exhaustive search

Martín Hötzel Escardó. Infinite sets that admit fast exhaustive search. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings. pages 443-452, IEEE Computer Society, 2007. [doi]

@inproceedings{Escardo07,
  title = {Infinite sets that admit fast exhaustive search},
  author = {Martín Hötzel Escardó},
  year = {2007},
  doi = {10.1109/LICS.2007.25},
  url = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.25},
  tags = {search},
  researchr = {https://researchr.org/publication/Escardo07},
  cites = {0},
  citedby = {0},
  pages = {443-452},
  booktitle = {22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings},
  publisher = {IEEE Computer Society},
}