MFPS 26

http://www.math.tulane.edu/~mfps/mfps26/Titles_and_Abstracts.html

В Оттаву ехать, всё таки, облом, но есть интересные доклады, особенно Эскардо..

"I'll begin by developing and applying the topological view of computation to perform seemingly impossible practical and theoretical tasks, based on some of my papers, including "Infinite sets that admit fast exhaustive search" and "Exhaustible sets in higher-type computation". For example, (1) sets that admit exhaustive search in finite time are topologically compact, [...]"

Надо будет понять, как это работает:

http://www.cs.bham.ac.uk/~mhe/