Exhaustible sets in higher-type computation
Work
Year: 2008
Type: article
Abstract: We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicat... more
Author Martı́n Hötzel Escardó
Institution University of Birmingham
Cites: 41
Cited by: 34
Related to: 10
FWCI: 3.321
Citation percentile (by year/subfield): 88.77
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond