↓ Skip to main content

Computability and Complexity

Overview of attention for book
Cover of 'Computability and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Cameo of a Consummate Computabilist
  3. Altmetric Badge
    Chapter 2 Surfing with Rod
  4. Altmetric Badge
    Chapter 3 Prequel to the Cornell Computer Science Department
  5. Altmetric Badge
    Chapter 4 Some Questions in Computable Mathematics
  6. Altmetric Badge
    Chapter 5 Introduction to Autoreducibility and Mitoticity
  7. Altmetric Badge
    Chapter 6 The Complexity of Complexity
  8. Altmetric Badge
    Chapter 7 Bounded Pushdown Dimension vs Lempel Ziv Information Density
  9. Altmetric Badge
    Chapter 8 Complexity with Rod
  10. Altmetric Badge
    Chapter 9 On Being Rod’s Graduate Student
  11. Altmetric Badge
    Chapter 10 Herrmann’s Beautiful Theorem on Computable Partial Orderings
  12. Altmetric Badge
    Chapter 11 Effectiveness of Hindman’s Theorem for Bounded Sums
  13. Altmetric Badge
    Chapter 12 Reverse Mathematics of Matroids
  14. Altmetric Badge
    Chapter 13 Weakly Represented Families in Reverse Mathematics
  15. Altmetric Badge
    Chapter 14 The Vitali Covering Theorem in the Weihrauch Lattice
  16. Altmetric Badge
    Chapter 15 Parallel and Serial Jumps of Weak Weak König’s Lemma
  17. Altmetric Badge
    Chapter 16 Effectively Existentially-Atomic Structures
  18. Altmetric Badge
    Chapter 17 Irreducibles and Primes in Computable Integral Domains
  19. Altmetric Badge
    Chapter 18 Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
  20. Altmetric Badge
    Chapter 19 Enumeration Reducibility and Computable Structure Theory
  21. Altmetric Badge
    Chapter 20 Strength and Weakness in Computable Structure Theory
  22. Altmetric Badge
    Chapter 21 On Constructive Nilpotent Groups
  23. Altmetric Badge
    Chapter 22 Computable Model Theory over the Reals
  24. Altmetric Badge
    Chapter 23 The Lattice of Computably Enumerable Vector Spaces
  25. Altmetric Badge
    Chapter 24 Injection Structures Specified by Finite State Transducers
  26. Altmetric Badge
    Chapter 25 A Survey on Universal Computably Enumerable Equivalence Relations
  27. Altmetric Badge
    Chapter 26 $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$
  28. Altmetric Badge
    Chapter 27 A Survey of Results on the d-c.e. and n-c.e. Degrees
  29. Altmetric Badge
    Chapter 28 There Are No Maximal d.c.e. wtt -degrees
  30. Altmetric Badge
    Chapter 29 A Rigid Cone in the Truth-Table Degrees with Jump
  31. Altmetric Badge
    Chapter 30 Asymptotic Density and the Theory of Computability: A Partial Survey
  32. Altmetric Badge
    Chapter 31 On Splits of Computably Enumerable Sets
  33. Altmetric Badge
    Chapter 32 1-Generic Degrees Bounding Minimal Degrees Revisited
  34. Altmetric Badge
    Chapter 33 Nondensity of Double Bubbles in the D.C.E. Degrees
  35. Altmetric Badge
    Chapter 34 On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets
  36. Altmetric Badge
    Chapter 35 Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees
  37. Altmetric Badge
    Chapter 36 On the Reals Which Cannot Be Random
  38. Altmetric Badge
    Chapter 37 A Note on the Differences of Computably Enumerable Reals
  39. Altmetric Badge
    Chapter 38 Effective Bi-immunity and Randomness
  40. Altmetric Badge
    Chapter 39 On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
  41. Altmetric Badge
    Chapter 40 Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
  42. Altmetric Badge
    Chapter 41 Algorithmic Statistics: Forty Years Later
  43. Altmetric Badge
    Chapter 42 Computability and Complexity
  44. Altmetric Badge
    Chapter 43 Erratum to: There Are No Maximal d.c.e. wtt -degrees
Attention for Chapter 14: The Vitali Covering Theorem in the Weihrauch Lattice
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

4 X users


3 Dimensions

Readers on

1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The Vitali Covering Theorem in the Weihrauch Lattice
Chapter number 14
Book title
Computability and Complexity
Published in
arXiv, January 2017
DOI 10.1007/978-3-319-50062-1_14
Book ISBNs
978-3-31-950061-4, 978-3-31-950062-1

Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly, Brattka, Vasco, Gherardi, Guido, Hölzl, Rupert, Pauly, Arno

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 27 July 2016.
All research outputs
of 23,852,579 outputs
Outputs from arXiv
of 990,619 outputs
Outputs of similar age
of 425,078 outputs
Outputs of similar age from arXiv
of 16,522 outputs
Altmetric has tracked 23,852,579 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 990,619 research outputs from this source. They receive a mean Attention Score of 4.0. This one has gotten more attention than average, scoring higher than 53% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 425,078 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 29th percentile – i.e., 29% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 16,522 others from the same source and published within six weeks on either side of this one. This one is in the 45th percentile – i.e., 45% of its contemporaries scored the same or lower than it.