An ordinal that cannot be reached by any recursive function or notation system.
MathematicsOrdinalLogicSet Theory
Current best complexity is 52:
Recursively inaccessible ordinal can be discovered in Concepts, categorized under Mathematics, Ordinal, Logic, Set Theory. An ordinal that cannot be reached by any recursive function or notation system.
It has been discovered by 1 board and crafted 1 time, first appearing 36 hours ago. Recursively inaccessible ordinal can be created from 1 recipe, and goes on to appear as an ingredient in 3 others.
Recursively inaccessible ordinal was first discovered by Hello5184's board 36 hours ago. They also hold the lowest-complexity recipe, at 52.
Related concepts worth exploring include Infinity, Delta, Paradox, Binary System, Fractal, Sphere, and 6 more.