Loading Events

« All Events

  • This event has passed.

Code-Free Recursion and Realizability

February 24, 2014 @ 2:00 pm - 4:00 pm

Erich Faber
(University of Utrecht)

The theory of partial combinatory algebras can be regarded as a generalization of both recursion theory and the theory of realizability. Partial combinatory algebras give rise to structures called realizability toposes, the archetype of which is the effective topos. The combination of the geometrical nature of a topos and the computational character of a partial combinatory algebra yields an interesting theory in which a lot is still to discover. In my talk, I will treat both sides, and discuss some results of my thesis that, for example, point out the role of generalized relative recursion in this study.



February 24, 2014
2:00 pm - 4:00 pm


room b1.470, building 31
Jaffalaan 5, Delft, 2628 BX Netherlands
+ Google Map