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 paradox

Add to your list(s) Download to your calendar using vCal

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.