Tag Archives: computability

Seventeenth International Conference on Computability and Complexity in Analysis

This week (9.09-11.09) the Seventeenth International Conference on Computability and Complexity in Analysis (CCA) is taking place virtually via Microsoft Teams (originally planned for Bologna, Italy).

Arno Pauly is among the invited speakers. He will give a talk on Weinrauch complexity this Friday.

Seminar series on Computability Theory and its Applications

Our colleague Arno Pauly is on the Programme Committee of the Computability Theory and its Applications seminar series, which currently is taking place virtually.

The seminar now has a YouTube channel where you can find the recordings of past talks you may have missed. The information on future talks, the timings of those, and the links to the videos are all available on the webpage here:

CTA Seminar – Computability

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.

Translate »