Computable ordinal

In mathematics, specifically computability and set theory, a computable (or recursive) ordinal is an ordinal number that can be represented as a computable well-ordering of natural numbers.

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.