Concept information
Preferred term
computable number
Definition(s)
-
In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers, effective numbers or the computable reals or recursive reals. The concept of a computable real number was introduced by Emile Borel in 1912, using the intuitive notion of computability available at the time.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Computable_number)
Broader concept(s)
Synonym(s)
- computable real
- effective number
- recursive number
- recursive real
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/PSR-SPX44C8G-0
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}