Selwyn Ng on Key Reducibilities in Computability Theory 🧠

Join Selwyn Ng's insightful talk at the Workshop on Reverse Mathematics and Higher Computability Theory, exploring fundamental reducibilities that shape our understanding of computability in this comprehensive session.

Selwyn Ng on Key Reducibilities in Computability Theory 🧠
Selwyn Ng on Key Reducibilities in Computability Theory 🧠

About this video

This talk was part of the Workshop on "Reverse Mathematics and Higher Computability Theory" held at the ESI June 30 - July 4, 2025.

We will discuss some recent results on reducibilities and degree structures in computability. This talk will be expository, covering the degree structures arising from several reducibilites in computability. These results are motivated by their interactions with classical computability, constructive mathematics, effective topology and reverse mathematics.

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

71

Likes

1

Duration

48:15

Published

Jul 7, 2025

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.