University of Birmingham > Talks@bham > Lab Lunch > Searchable sets, Dubuc-Penon compactness, the omniscience principle, and the drinker paradox

## Searchable sets, Dubuc-Penon compactness, the omniscience principle, and the drinker paradoxAdd to your list(s) Download to your calendar using vCal - Martin Escardo
- Tuesday 26 January 2010, 13:00-14:00
- CS 124.
If you have a question about this talk, please contact Dan Ghica. The talk will be accessible to the general lablunch audience. In previous work I developed algorithms to exhaustively search certain infinite sets in finite time (called searchable). In topological terms, searchable sets must be compact. But I won’t do topology this time. Instead, I’ll discuss a number of equivalent logical characterizations, alluded to in the title. This talk is part of the Lab Lunch series. ## This talk is included in these lists:- CS 124
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Lab Lunch
- Theoretical computer science seminar
Note that ex-directory lists are not shown. |
## Other listsNuclear physics seminars Contemporary History analysis## Other talks |