A mathematical expression involving transfinite ordinal numbers and recursion.
MathematicsSet TheoryOrdinal NumberRecursion
Current best complexity is 97:
ψ(Ω^Ω^ψ(ε₁)) can be discovered in Concepts, categorized under Mathematics, Set Theory, Ordinal Number, Recursion. A mathematical expression involving transfinite ordinal numbers and recursion.
It has been discovered by 1 board and crafted 1 time, first appearing 35 hours ago. ψ(Ω^Ω^ψ(ε₁)) can be created from 1 recipe, and goes on to appear as an ingredient in 1 other.
ψ(Ω^Ω^ψ(ε₁)) was first discovered by Hello5184's board 35 hours ago. They also hold the lowest-complexity recipe, at 97.
Related concepts worth exploring include Infinity, Delta, Binary System, Fractal, Sphere, Tesseract, and 6 more.