Part 1: Sunday, Silverman Hall S-240a.
| Time | Speaker | Title |
|---|---|---|
| 2:00 - 2:20 | Jason Block | Computability for tree presentations of continuum-size structures. |
| 2:30 - 2:50 | Neil Lutz | Algorithmic information bounds for distances and orthogonal projections. |
| 3:00 - 3:20 | Peter Gerdes | Comparing notions of dense computability on $\omega^\omega$ and $2^\omega$. |
| 3:30 - 3:50 | David Gonzalez | Effective aspects of the tree of tuples construction. |
| 4:00 - 4:20 | Valentina Harizanov | Complexity of exact and approximate isomorphisms. |
Part 2: Monday, Silverman Hall S-240a.
| Time | Speaker | Title |
|---|---|---|
| 2:00 - 2:20 | Meng-Che “Turbo” Ho | Scott analysis of the Farey graph. |
| 2:30 - 2:50 | Johanna Franklin | Highness for Scott rank. |
| 3:00 - 3:20 | Patrick Lutz | The Kučera-Gács Theorem and computable measures. |
| 3:30 - 3:50 | Mariya Soskova | Intuitionism and computing with partial information. |
| 4:00 - 4:20 | Heidi Benham | Problem reducibilities of topologically inspired order principles. |