test FOO test
Computability in Europe 2006
Logical Approaches to Computational Barriers
We will give a survey of some results in realizability including:
- basic notions and control operators associated to Pierce's
- the definition of data-types and storage operators (which are
- the interaction of intuitionistic and classical proofs to extract
algorithm (illustrated by Dickson's lemma).
- the use of the system clock to realize the intentional axiom of
We will also give a short list of open problems.
websites: Arnold Beckmann