University of Birmingham > Talks@bham > Lab Lunch > Partial functions and recursion via dominances in univalent type theory

## Partial functions and recursion via dominances in univalent type theoryAdd to your list(s) Download to your calendar using vCal - Cory Knapp
- Thursday 03 August 2017, 12:00-13:00
- CS 217.
If you have a question about this talk, please contact Dr Steve Vickers. We develop computability in a constructive univalent type theory, without assuming countable choice or Markov’s principle, paying special attention to the handling of partiality in this setting via the notion of dominance. During our development, we will consider the consequences of working with computability as property or structure. A guiding question is what, if any, notion of partial function allows the proposition “all partial functions on natural numbers are Turing computable” to be consistent. This is a practice talk for CSL 2017 . This talk is part of the Lab Lunch series. ## This talk is included in these lists:- CS 217
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Lab Lunch
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsComputer Science Lunch Time Talk Series Medical Imaging Research Seminars Geometry and Mathematical Physics seminar## Other talksTBC Advancing biomedical photoacoustic imaging using structured light and optical microresonators |