↓ Skip to main content

The Nature of Computation. Logic, Algorithms, Applications

Overview of attention for book
Cover of 'The Nature of Computation. Logic, Algorithms, Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Real Benefit of Promises and Advice
  3. Altmetric Badge
    Chapter 2 Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
  4. Altmetric Badge
    Chapter 3 An Overview of Genomic Distances Modeled with Indels
  5. Altmetric Badge
    Chapter 4 Noise versus Computational Intractability in Dynamics
  6. Altmetric Badge
    Chapter 5 Cluster Editing
  7. Altmetric Badge
    Chapter 6 Beyond Rogers’ Non-constructively Computable Function
  8. Altmetric Badge
    Chapter 7 Constructing Continuous Systems from Discrete Cellular Automata
  9. Altmetric Badge
    Chapter 8 Latency-Bounded Target Set Selection in Social Networks
  10. Altmetric Badge
    Chapter 9 Summary Data Structures for Massive Data
  11. Altmetric Badge
    Chapter 10 Determinant versus Permanent: Salvation via Generalization?
  12. Altmetric Badge
    Chapter 11 Aligning and Labeling Genomes under the Duplication-Loss Model
  13. Altmetric Badge
    Chapter 12 Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
  14. Altmetric Badge
    Chapter 13 Processes Inspired by the Functioning of Living Cells: Natural Computing Approach
  15. Altmetric Badge
    Chapter 14 Recent Developments in Collective Decision Making in Combinatorial Domains
  16. Altmetric Badge
    Chapter 15 Software Streams: Big Data Challenges in Dynamic Program Analysis
  17. Altmetric Badge
    Chapter 16 On λ -Definable Functions on Ordinals
  18. Altmetric Badge
    Chapter 17 A Personal View of the P versus NP Problem
  19. Altmetric Badge
    Chapter 18 An Investigation on Genomic Repeats
  20. Altmetric Badge
    Chapter 19 Local Computability for Ordinals
  21. Altmetric Badge
    Chapter 20 A Note on the Sequential Version of ${\rm \Pi^1_2}$ Statements
  22. Altmetric Badge
    Chapter 21 On Conservative Learning of Recursively Enumerable Languages
  23. Altmetric Badge
    Chapter 22 Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations
  24. Altmetric Badge
    Chapter 23 The Nature of Computation. Logic, Algorithms, Applications
  25. Altmetric Badge
    Chapter 24 Discovering Hidden Repetitions in Words
  26. Altmetric Badge
    Chapter 25 Language Forbidding-Enforcing Systems Defining DNA Codewords
  27. Altmetric Badge
    Chapter 26 Computing K -Trivial Sets by Incomplete Random Sets
  28. Altmetric Badge
    Chapter 27 Cardinal-Recognizing Infinite Time Turing Machines
  29. Altmetric Badge
    Chapter 28 ‘Stored Program Concept’ Considered Harmful: History and Historiography
  30. Altmetric Badge
    Chapter 29 The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games
  31. Altmetric Badge
    Chapter 30 The Computation of Nature, Or: Does the Computer Drive Science and Technology?
  32. Altmetric Badge
    Chapter 31 Negative Glues and Non-determinism in Nanocomputations by Self-assembly
  33. Altmetric Badge
    Chapter 32 Structures without Scattered-Automatic Presentation
  34. Altmetric Badge
    Chapter 33 The Nature of Computation. Logic, Algorithms, Applications
  35. Altmetric Badge
    Chapter 34 Closed Choice for Finite and for Convex Sets
  36. Altmetric Badge
    Chapter 35 Realizability Models Separating Various Fan Theorems
  37. Altmetric Badge
    Chapter 36 Towards a Theory of Homomorphic Compression
  38. Altmetric Badge
    Chapter 37 The Nature of Computation. Logic, Algorithms, Applications
  39. Altmetric Badge
    Chapter 38 Exploiting Co-evolution across Protein Families for Predicting Native Contacts and Protein-Protein Interaction Surfaces
  40. Altmetric Badge
    Chapter 39 A Compositional Semantics of Reaction Systems with Restriction
  41. Altmetric Badge
    Chapter 40 Using Random Graphs in Population Genomics
  42. Altmetric Badge
    Chapter 41 The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models
  43. Altmetric Badge
    Chapter 42 The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
  44. Altmetric Badge
    Chapter 43 A Note on ω -Jump Inversion of Degree Spectra of Structures
  45. Altmetric Badge
    Chapter 44 The Turing Universe in the Context of Enumeration Reducibility
  46. Altmetric Badge
    Chapter 45 Computing Game Strategies
  47. Altmetric Badge
    Chapter 46 On Processes and Structures
  48. Altmetric Badge
    Chapter 47 Various Regularity Lemmas in Graphs and Hypergraphs
  49. Altmetric Badge
    Chapter 48 The Nature of Computation. Logic, Algorithms, Applications
  50. Altmetric Badge
    Chapter 49 Another Jump Inversion Theorem for Structures
  51. Altmetric Badge
    Chapter 50 On Algorithmic Strong Sufficient Statistics
  52. Altmetric Badge
    Chapter 51 Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
Attention for Chapter 27: Cardinal-Recognizing Infinite Time Turing Machines
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • High Attention Score compared to outputs of the same age and source (85th percentile)

Mentioned by

twitter
4 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
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
Cardinal-Recognizing Infinite Time Turing Machines
Chapter number 27
Book title
The Nature of Computation. Logic, Algorithms, Applications
Published in
arXiv, October 2013
DOI 10.1007/978-3-642-39053-1_27
Book ISBNs
978-3-64-239052-4, 978-3-64-239053-1
Authors

Miha E. Habič, Habič, Miha E.

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 2. 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 22 October 2013.
All research outputs
#14,909,825
of 23,852,579 outputs
Outputs from arXiv
#297,801
of 990,619 outputs
Outputs of similar age
#121,519
of 214,274 outputs
Outputs of similar age from arXiv
#1,362
of 10,181 outputs
Altmetric has tracked 23,852,579 research outputs across all sources so far. This one is in the 35th percentile – i.e., 35% 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 66% 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 214,274 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 40th percentile – i.e., 40% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 10,181 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.