“…3 See (Oxtoby, 1980). 4 See (Huttegger, 2015), (Weatherson, 2015), (Elga, 2016), (Belot, 2017), (Cisewski et al, 2018), (Pomatto and Sandroni, 2018), (Nielsen and Stewart, 2019), and (Gong et al, 2021). 5 The computability-theoretic approach advocated in this paper is in line with (Huttegger et al, 2023) (see also (Zaffora Blando, 2020)), where Lévy's Upward Theorem is studied through the lens of computability theory and the theory of algorithmic randomness-a branch of computability theory on which we rely here, as well.…”