skip to content

# Computing beyond Constructibility: The Recognizability Strength of Ordinal Time Machines

Date:
Wednesday 16th December 2015 - 13:30 to 14:30
Venue:
INI Seminar Room 1
Abstract:
Co-author: Philipp Schlicht (Universität Bonn)

Transfinite machine models of computation provide an approach to an `effective mathematics of the uncountable'. However, their set-theoretical interest seems to be limited by the fact that even the strongest such model, Koepke's Ordinal Turing Machines with parameters (pOTMs), can only compute constructible sets.

Recognizability is a more liberal notion than computability in that it only requires the machine to be able to identify a certain object when it is given to it as an input, not to produce that object.

By invoking notions from algorithmic randomness and considering recognizability rather than computability, we connect transfinite computability to large cardinals and forcing axioms incompatible with the axiom of constructibility on the one hand and inner models for large cardinals on the other. In particular, under appropriate large cardinal assumptions, a real number is heriditarily recognizable by a pOTM if and only if it is an element of the mouse for one Woodin cardinal. This is joint work with Philipp Schlicht.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.