The universal algorithm: a new simple proof of Woodin’s theorem
This is the third in a series of posts I’ve made recently concerning what I call the universal algorithm, which is a program that can in principle compute any function, if only you should run…
