Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Specker Sequence: Computability Theory, Computable Function -

englanti
2026-03-20
125,22 € 166,96 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

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 th ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786131194924
Kirjoita oma arvostelusi
Arvostelet: Specker Sequence: Computability Theory, Computable Function
Arvostelusi:

Goodreads-arvostelut

125,22 € 166,96 €