University of Birmingham > Talks@bham > Lab Lunch > Computability and recursion theory in univalent type theory

Computability and recursion theory in univalent type theory

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

If you have a question about this talk, please contact Dr Steve Vickers.

Room as usual, despite earlier announcement

Finishing the talk from 10 Feb 2017

We will recap the basic definitions from last time, before continuing on to sketch basic recursion theory with abstract Turing machines. Finally, we will briefly examine how various results about r.e. sets need to be reworked in a constructive context.

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.