Post #2636083
2026-05-05 22:46 UTC
@andrejbauer@mathstodon.xyz @JacquesC2@types.pl (off topic and inconsequential) Well, as you know, there is the *universal algorithm*. This algorithm has the property that, for every function f : ℕ → ℕ, there is a universe such that, when run there, it computes exactly f [on all standard inputs]. But this universe does not contain a proof of this fact. Indeed, it contains a disproof. :-)
Newcomers to the universal algorithm might enjoy this introduction: https://juliakw.net/research/talks/2020-oct-universal-algorithm/univ-alg.pdf (slides by Kameryn Williams)
Replies (1)
-
@andrejbauer@mathstodon.xyz 2026-05-07 10:59
@iblech@mathstodon.xyz @JacquesC2@types.pl Somehow I suspect Theory A people don't have that sort of thing in mind, but one should certainly attempt to publish an algorithms paper along these lines, maybe on April 1.