Higher Type Recursion in Transfinite Computational Models

Explore Kleene's Turing machine model of Type 2 computation extended to infinite time Turing machines in this 44-minute conference talk. Examine the compelling analogies between finite and transfinite computational frameworks while delving into higher type recursion theory. Discover how classical computational models can be lifted to handle transfinite operations and understand the mathematical structures that emerge in this advanced computational setting. Learn about the theoretical foundations that connect traditional recursion theory with higher-order computational models operating beyond finite time constraints.