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 (1949).
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
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 (1949).
has abstract
In computability theory, a Spe ...... e least upper bound principle.
@en
In der Berechenbarkeitstheorie ...... äquivalent zu ACA0 über RCA0.
@de
Une suite de Specker est un co ...... ois Ernst Specker (1920-2011).
@fr
Wikipage page ID
21,535,918
page length (characters) of wiki page
Wikipage revision ID
942,911,304
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In computability theory, a Spe ...... ucted by Ernst Specker (1949).
@en
In der Berechenbarkeitstheorie ...... äquivalent zu ACA0 über RCA0.
@de
Une suite de Specker est un co ...... ois Ernst Specker (1920-2011).
@fr
label
Specker sequence
@en
Specker-Folge
@de
Suite de Specker
@fr