Higher Type Recursion in Transfinite Computational models

Philip Welch (U Bristol)

Jul 04. 2025, 10:15 — 11:00

We consider Kleene's Turing machine model of Type 2 computation, lifted to the infinite time Turing machine case. There are several satisfying analogies between the two arenas.

Further Information

Venue:: ESI Schrödinger and Boltzmann Lecture Hall
Associated Event:: Reverse Mathematics (Thematic Programme)
Organizer(s):: Juan Aguilera (TU Vienna)
Linda Brown Westrick (Penn State U)
Noam Greenberg (Victoria U of Wellington)
Denis Hirschfeldt (U of Chicago)