Explore relationships

Specker sequence

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.

Use + to expand a branch. Click a topic name to open its summary.