Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Specker Sequence: Computability Theory, Computable Function -

angļu valoda
2026-03-20
125,22 € 166,96 €

-25% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786131194924
Rakstiet savu atsauksmi
Jūs vērtējat: Specker Sequence: Computability Theory, Computable Function
Jūsu novērtējums:

Goodreads atsauksmes

125,22 € 166,96 €