Fun facts: x is the smallest algorithmically unreachable number in ZF, x is a technically computable number due to its simple definability in ZF but unreachable by any computational means in ZF, x does not collapse into a paradox due to FOST being greater than ZF by immesurable magnitudes
