An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 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 computable ordinals are exactly the ordinals that have an ordinal notation in Kleene's .

Property Value
dbo:abstract
  • Berechenbare Ordinalzahlen sind die Ordnungstypen berechenbarer Wohlordnungen.Sie werden in der theoretischen Informatik, genauer in der Berechenbarkeitstheorie, behandelt.Die Menge der berechenbaren Ordinalzahlen bildet ein abzählbares Anfangsstück der natürlichen Anordnung aller Ordinalzahlen. (de)
  • 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 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 . The Church–Kleene ordinal is a limit ordinal. An ordinal is computable if and only if it is smaller than . Since there are only countably many computable relations, there are also only countably many computable ordinals. Thus, is countable. The computable ordinals are exactly the ordinals that have an ordinal notation in Kleene's . (en)
dbo:wikiPageID
  • 5173979 (xsd:integer)
dbo:wikiPageLength
  • 1784 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1039574306 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Berechenbare Ordinalzahlen sind die Ordnungstypen berechenbarer Wohlordnungen.Sie werden in der theoretischen Informatik, genauer in der Berechenbarkeitstheorie, behandelt.Die Menge der berechenbaren Ordinalzahlen bildet ein abzählbares Anfangsstück der natürlichen Anordnung aller Ordinalzahlen. (de)
  • 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 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 computable ordinals are exactly the ordinals that have an ordinal notation in Kleene's . (en)
rdfs:label
  • Berechenbare Ordinalzahl (de)
  • Computable ordinal (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License