University of Bristol
4pm Thursday,18th November, 2010
Room 4.31/33, Informatics Forum
Computational Models that take transfinite numbers of steps are interesting in their right and have connections with areas of computation, philosophical theories of truth, and low level set theory.
We illustrate with some models in the literature and talk about the connections in particular with generalisations of monotone inductive definitions and determinacy of infinite two person perfect information games.