↓ Skip to main content

Logical Approaches to Computational Barriers

Overview of attention for book
Cover of 'Logical Approaches to Computational Barriers'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
  3. Altmetric Badge
    Chapter 2 From Constructibility and Absoluteness to Computability and Domain Independence
  4. Altmetric Badge
    Chapter 3 Datatype-Generic Reasoning
  5. Altmetric Badge
    Chapter 4 The Logical Strength of the Uniform Continuity Theorem
  6. Altmetric Badge
    Chapter 5 Elementary Algebraic Specifications of the Rational Function Field
  7. Altmetric Badge
    Chapter 6 Random Closed Sets
  8. Altmetric Badge
    Chapter 7 Deep Inference and Its Normal Form of Derivations
  9. Altmetric Badge
    Chapter 8 Logspace Complexity of Functions and Structures
  10. Altmetric Badge
    Chapter 9 Prefix-Like Complexities and Computability in the Limit
  11. Altmetric Badge
    Chapter 10 Partial Continuous Functions and Admissible Domain Representations
  12. Altmetric Badge
    Chapter 11 An Invariant Cost Model for the Lambda Calculus
  13. Altmetric Badge
    Chapter 12 On the Complexity of the Sperner Lemma
  14. Altmetric Badge
    Chapter 13 The Church-Turing Thesis: Consensus and Opposition
  15. Altmetric Badge
    Chapter 14 Gödel and the Origins of Computer Science
  16. Altmetric Badge
    Chapter 15 The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
  17. Altmetric Badge
    Chapter 16 Turing Universality in Dynamical Systems
  18. Altmetric Badge
    Chapter 17 Every Sequence Is Decompressible from a Random One
  19. Altmetric Badge
    Chapter 18 Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
  20. Altmetric Badge
    Chapter 19 LJQ: A Strongly Focused Calculus for Intuitionistic Logic
  21. Altmetric Badge
    Chapter 20 Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms
  22. Altmetric Badge
    Chapter 21 What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?
  23. Altmetric Badge
    Chapter 22 An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
  24. Altmetric Badge
    Chapter 23 Enumeration Reducibility with Polynomial Time Bounds
  25. Altmetric Badge
    Chapter 24 Coinductive Proofs for Basic Real Computation
  26. Altmetric Badge
    Chapter 25 A Measure of Space for Computing over the Reals
  27. Altmetric Badge
    Chapter 26 On Graph Isomorphism for Restricted Graph Classes
  28. Altmetric Badge
    Chapter 27 Infinite Time Register Machines
  29. Altmetric Badge
    Chapter 28 Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
  30. Altmetric Badge
    Chapter 29 Forcing with Random Variables and Proof Complexity
  31. Altmetric Badge
    Chapter 30 Complexity-Theoretic Hierarchies
  32. Altmetric Badge
    Chapter 31 Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
  33. Altmetric Badge
    Chapter 32 Lower Bounds Using Kolmogorov Complexity
  34. Altmetric Badge
    Chapter 33 The Jump Classes of Minimal Covers
  35. Altmetric Badge
    Chapter 34 Space Bounds for Infinitary Computation
  36. Altmetric Badge
    Chapter 35 From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
  37. Altmetric Badge
    Chapter 36 Towards a Trichotomy for Quantified H-Coloring
  38. Altmetric Badge
    Chapter 37 Two Open Problems on Effective Dimension
  39. Altmetric Badge
    Chapter 38 Optimization and Approximation Problems Related to Polynomial System Solving
  40. Altmetric Badge
    Chapter 39 Uncomputability Below the Real Halting Problem
  41. Altmetric Badge
    Chapter 40 Constraints on Hypercomputation
  42. Altmetric Badge
    Chapter 41 Martingale Families and Dimension in P
  43. Altmetric Badge
    Chapter 42 Can General Relativistic Computers Break the Turing Barrier?
  44. Altmetric Badge
    Chapter 43 Degrees of Weakly Computable Reals
  45. Altmetric Badge
    Chapter 44 Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis
  46. Altmetric Badge
    Chapter 45 A Subrecursive Refinement of the Fundamental Theorem of Algebra
  47. Altmetric Badge
    Chapter 46 An Introduction to Program and Thread Algebra
  48. Altmetric Badge
    Chapter 47 Fast Quantifier Elimination Means P = NP
  49. Altmetric Badge
    Chapter 48 Admissible Representations in Computable Analysis
  50. Altmetric Badge
    Chapter 49 Do Noetherian Modules Have Noetherian Basis Functions?
  51. Altmetric Badge
    Chapter 50 Inverting Monotone Continuous Functions in Constructive Analysis
  52. Altmetric Badge
    Chapter 51 Partial Recursive Functions in Martin-Löf Type Theory
  53. Altmetric Badge
    Chapter 52 Partially Ordered Connectives and ∑1 1 on Finite Models
  54. Altmetric Badge
    Chapter 53 Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes
  55. Altmetric Badge
    Chapter 54 Gödel’s Conflicting Approaches to Effective Calculability
  56. Altmetric Badge
    Chapter 55 Co-total Enumeration Degrees
  57. Altmetric Badge
    Chapter 56 Relativized Degree Spectra
  58. Altmetric Badge
    Chapter 57 Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
  59. Altmetric Badge
    Chapter 58 Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
  60. Altmetric Badge
    Chapter 59 Kurt Gödel and Computability Theory
  61. Altmetric Badge
    Chapter 60 A Computability Theory of Real Numbers
  62. Altmetric Badge
    Chapter 61 Primitive Recursive Selection Functions over Abstract Algebras
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • Good Attention Score compared to outputs of the same age (74th percentile)
  • High Attention Score compared to outputs of the same age and source (85th percentile)

Mentioned by

2 tweeters
1 Wikipedia page


2 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.
Logical Approaches to Computational Barriers
Published by
Lecture notes in computer science, January 2006
DOI 10.1007/11780342
978-3-54-035466-6, 978-3-54-035468-0

Beckmann, Arnold


Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker

Twitter Demographics

The data shown below were collected from the profiles of 2 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 100%
Readers by discipline Count As %
Mathematics 1 100%

Attention Score in Context

This research output has an Altmetric Attention Score of 5. 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 25 September 2017.
All research outputs
of 12,523,155 outputs
Outputs from Lecture notes in computer science
of 7,290 outputs
Outputs of similar age
of 268,293 outputs
Outputs of similar age from Lecture notes in computer science
of 188 outputs
Altmetric has tracked 12,523,155 research outputs across all sources so far. Compared to these this one has done well and is in the 76th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 7,290 research outputs from this source. They receive a mean Attention Score of 4.4. This one has done well, scoring higher than 77% 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 268,293 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 74% of its contemporaries.
We're also able to compare this research output to 188 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 85% of its contemporaries.