In mathematical logic and set theory, a **computable ordinal** is an ordinal number that can be represented or described by a computable function or a Turing machine. More specifically, it refers to ordinals that can be generated by a process that can be executed by a computer, meaning their elements, or the rule to describe them, can be computed in a finite amount of time with a defined procedure.
Articles by others on the same topic
There are currently no matching articles.