Keywords

#specker_sequence

Specker sequence

Sequence of rational numbers

In computability theory, a Specker sequence is a computable, monotonically increasing, bounded sequence of rational numbers whose supremum is not a computable real number. The first example of such a sequence was constructed by Ernst Specker (1949).

Fri 26th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Specker sequence Computable number Specker Ernst Specker Zeno machine Definable real number Effective topos Hypercomputation Computation in the limit Computable analysis
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.