Modes of Bar Recursion

Add to your list(s) Download to your calendar using vCal

• Tom Powell, Queen Mary, University of London
• Tuesday 03 July 2012, 16:00-17:00
• CS 217.

If you have a question about this talk, please contact Paul Levy.

Bar recursion can be characterised as recursion over well founded trees. One of the best known instances of this type of recursion is Spector’s bar recursion, devised in the 1960s to give a computational interpretation to the axiom of dependent choice. This talk focuses on some computational aspects of bar recursion. I shall introduce several important variants of bar recursion, and discuss some ongoing research into understanding the relationship between them.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.