Old and new results on the computably enumerable sets

Peter Cholak (University of Notre-Dame)

01-Mar-2022, 20:00-21:00 (2 years ago)

Abstract: We will survey a number of old results on the computably enumerable sets and finish with a few new results. The computably enumerable sets are interesting since anything which can happen computably happens in computably enumerable sets.

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

Export talk to