Recursion Theory and Diophantine Approximation
Theodore Slaman (UC Berkeley)
Abstract: We will give a survey of some connections between Recursion Theory, especially Algorithmic Randomness, and Diophantine Approximation, especially normality and exponents of irrationality. We will emphasize what we view as the contribution of a recursion theoretic perspective.
logic
Audience: researchers in the topic
Computability theory and applications
Series comments: Description: Computability theory, logic
The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.
Organizers: | Damir Dzhafarov*, Vasco Brattka*, Ekaterina Fokina*, Ludovic Patey*, Takayuki Kihara, Noam Greenberg, Arno Pauly, Linda Brown Westrick |
*contact for this listing |