Self-similarity and recursion


Venue   Theory Seminar, School of Computer Science, University of Birmingham, 23 February 2007

Abstract   A common situation in mathematics and computer science is that we have a family of objects each of which is described in terms of the others. A simple example is a system of simultaneous linear equations in which each of the variables involved appears as the left-hand side of exactly one of the equations. Similarly, we might have a famly of datatypes defined in a mutually recursive way. It turns out that there is a useful general theory of such situations, connecting (among other things) to self-similarity in the world of topology. I will explain some of this theory and what it might be good for.

Slides   In this pdf file (2.3MB).

This page was last modified on 24 September 2008. Home