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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Partial functions and recursion via dominances 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.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cold atoms Speech Recognition by Synthesis Seminars Midlands Logic Seminar

Other talks

Signatures of structural criticality and universality in the cellular anatomy of the brain The percolating cluster is invisible to image recognition with deep learning Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems [Friday seminar]: Irradiated brown dwarfs in the desert
 

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