Specker Sequence
CHF 34.00
Auf Lager
SKU
478R05TKCHN
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 15.10.2025 und Do., 16.10.2025
Details
High Quality Content by WIKIPEDIA articles! In computability theory, a Specker sequence is a computable, strictly 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 in 1949. The existence of Specker sequences has consequences for computable analysis. The fact that such sequences exist means that the collection of all computable real numbers does not satisfy the least upper bound principle of real analysis. A common way to resolve this difficulty is to consider only sequences that are accompanied by a modulus of convergence; no Specker sequence has a computable modulus of convergence.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131194924
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131194924
- Format Fachbuch
- Titel Specker Sequence
- Herausgeber Betascript Publishing
- Anzahl Seiten 72
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
