<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
</head>
<body>
<div class="" style="word-wrap:break-word">This is an announcement of Tiago Royer's MS Presentation<br class="">
===============================================<br class="">
Candidate: Tiago Royer<br class="">
<br class="">
Date: Friday, May 13, 2022<br class="">
<br class="">
Time: 3 pm CST<br class="">
<br class="">
<div class="">Location: <b class="">Exam will now be held fully remote, please see zoom link below</b></div>
<div class=""><br class="">
</div>
<div class="">Remote Location: <a href="https://www.google.com/url?q=https://urldefense.com/v3/__https://uchicago.zoom.us/j/94748973840?pwd%3DVWhnck9ZTFBQbkplVDQ4bjJLMmdQQT09__;!!BpyFHLRN4TMTrA!5KjXVIwKMY2K0KcjGUVRQdoEWoPj2vBx7kOWlEItRzVsatE-Rm27zJjzVFN5QmuMIg6siVTm59unB074oviHebvZIXA$&sa=D&source=calendar&ust=1652299493616970&usg=AOvVaw3zWfGq0kYgsUv1YAspZ4ul" target="_blank" class="" style="color:rgb(26,115,232); font-family:Roboto,Arial,sans-serif; font-size:14px; font-variant-ligatures:normal; letter-spacing:0.2px; orphans:2; white-space:pre-wrap; widows:2; background-color:rgb(255,255,255)">https://uchicago.zoom.us/j/94748973840?pwd=VWhnck9ZTFBQbkplVDQ4bjJLMmdQQT09</a><br class="">
<br class="">
M.S. Paper Title: Asymptotic notions of computability: minimal pairs and randomness<br class="">
<br class="">
Abstract: The concepts of dense computability, generic computability, coarse computability, and effective dense computability all generalize the notion of computability by requiring the algorithm to get the right answer only for "most of the inputs", rather
than for all inputs (in a similar way that average-case complexity talks about expected running time, rather than imposing an upper bound in the running time of all inputs). These asymptotic notions of computability give rise to a degree structure analogous
to the Turing degrees, but with different properties. In this paper we focus on minimal pairs and the level of randomness that they demand. We survey the main results in the area, and additionally settle the question of the number of minimal pairs for generic
reducibility in the opposite direction that happens with the other reducibilities.<br class="">
<br class="">
Advisors: Denis Hirschfeldt and Janos Simon (co-advisor)<br class="">
<br class="">
Committee Members: Janos Simon, Denis Hirschfeldt, and Stuart Kurtz</div>
<div class=""><br class="">
</div>
<div class=""><br class="">
</div>
<div class=""></div>
</div>
<div class="" style="word-wrap:break-word">
<div class=""></div>
</div>
</body>
</html>