Recursively inaccessible ordinal

An ordinal that cannot be reached by any recursive function or notation system.

MathematicsOrdinalLogicSet Theory

Complexity

Current best complexity is 52:

Recursively inaccessible ordinal
52
Discover this myself!

Statistics

Discovered by
1board
Best recipe held by
1board
First discovered
36 hoursago
Crafted
1time
Made with
1recipe
Used in
3recipes

Highlights

  1. First discovered by
    Hello5184's board
    · 36 hours ago
  2. Lowest complexity52first held by
    Hello5184's board
    · 28 hours ago
  3. Last crafted by
    Hello5184's board
    · 36 hours ago
  4. Last used in a recipe by
    Hello5184's board
    · 36 hours ago

Related concepts

Infinity
Delta
Paradox
Binary System
Fractal
Sphere
Tesseract
Infinite
Hypercube
Cube
Redundancy
Tautology

Technical information

Concept ID
372586
Color
#3b5998
Emoji
♾️
Categories
Mathematics, Ordinal, Logic, Set Theory
Best complexity
52
First discovered
Nov 12, 2026, 14:12 UTC
Trademarked
No
Copyrighted
No

About "Recursively inaccessible ordinal" concept

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.

Recursively inaccessible ordinal ♾️ | Concepts