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

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.

Infinite-time computable analogues of the universal algorithm, Generalized Computability Theory Workshop, Spain, 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.

This entry was posted in Talks and tagged infinitary computability, Leibnizian models, pointwise definable, universal algorithm, universal definition by Joel David Hamkins. Bookmark the permalink.

LEAVE A REPLY

Please enter your comment!
Please enter your name here

More like this

Did Turing prove the undecidability of the halting problem?

Joel David Hamkins and Theodor Nenu, “Did Turing prove the undecidability of the halting problem?”, 18 pages,...

Enhancing Geometry Skills Working with Angles Color by Number

 Are you searching for a fun and effective way to reinforce special angle relationships in your geometry...

How the continuum hypothesis could have been a fundamental...

Joel David Hamkins, “How the continuum hypothesis could have been a fundamental axiom,” Journal for the Philosophy...