Computable ordinal
id:
computable-ordinal-196-13703022
title:
Computable ordinal
text:
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 α . It is easy to check that ω is computable. The successor of a computable ordinal is computable, and the set of all computable ordinals is closed downwards. The supremum of all computable ordinals is called the Church–Kleene ordinal, the first nonrecursive ordinal, and denoted by
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Computable_ordinal
date created:
date modified:
2024-01-23T22:15:02Z
main entity:
{"identifier":"Q7303347","url":"https://www.wikidata.org/entity/Q7303347"}
image:
fields total:
13
integrity:
13