20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Specker Sequence: Computability Theory, Computable Function -

English
2026-03-20
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131194924
Write Your Own Review
You're reviewing: Specker Sequence: Computability Theory, Computable Function
Your Rating:

Goodreads Reviews

€133.57 €166.96