Anonymous
public text v1 · immutableIs there a set GR of functions N -> N such that:
For all functions f : N -> N, there is a function g in GR such that f <= g, and
<= totally orders GR,
where f <= g iff for almost all x : N, f(x) <= g(x)Is there a set GR of functions N -> N such that:
For all functions f : N -> N, there is a function g in GR such that f <= g, and
<= totally orders GR,
where f <= g iff for almost all x : N, f(x) <= g(x)