Infinite-time computable analogues of the universal algorithm, Generalized Computability Theory Workshop, Spain, August 2014

This will be a talk at the Generalized Computability Theory workshop in Castro Urdiales, Spain, a beautiful setting on the sea near Bilbao, 19-23 August 2024.

Abstract. I shall present infinite-time computable analogues of the universal algorithm, which can in principle produce any desired output stream, if only it is run in the right set-theoretic universe, and then extended as desired in further universes.

Leave a Reply

Your email address will not be published. Required fields are marked *