Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01437306n
Noun Concept
AR
No term available
EN
In computability theory, a Specker sequence is a computable, monotonically increasing, bounded sequence of rational numbers whose supremum is not a computable real number. Wikipedia
Sources

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License