Nonrecursive ordinal

In set theory and mathematical logic, an ordinal is a way to describe the order type of a well-ordered set. Ordinals extend beyond finite numbers to describe infinite quantities in a structured manner. When discussing nonrecursive ordinals, we typically refer to ordinals that cannot be defined by a recursive or computable process. This often relates to their definability in terms of set-theoretic constructions or functions.