Keywords

#computable_ordinal

Computable ordinal

In mathematics, specifically computability and set theory, an ordinal is said to be computable or recursive if there is a computable well-ordering of a computable subset of the natural numbers having the order type .

Tue 23rd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Computable ordinal Large countable ordinal Computable function Ordinal number Nonrecursive ordinal Kleene's O Enumeration Ordinal data Fast-growing hierarchy Aleph number
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.