Computability Learning Seminar

Monday, April 20, 2026 1:00 pm - 2:30 pm EDT (GMT -04:00)

Elan Roth & William Dan, University of Waterloo

Randomness in the Arithmetic Hierarchy

We will introduce a problem posed by Bienvenu, Csima, and Harrison-Trainor about transforming indices of random left c.e. reals to optimal machines with specific halting probabilities. Then, we will prove two results that have been useful in our attempts to resolve the open problem.

MC 5403