↓ Skip to main content

Sailing Routes in the World of Computation

Overview of attention for book
Cover of 'Sailing Routes in the World of Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Journey to Computably Enumerable Structures (Tutorial Lectures)
  3. Altmetric Badge
    Chapter 2 Polynomial-Time Presentations of Algebraic Number Fields
  4. Altmetric Badge
    Chapter 3 Multiple Permitting and Array Noncomputability
  5. Altmetric Badge
    Chapter 4 Degrees of Categoricity for Prime and Homogeneous Models
  6. Altmetric Badge
    Chapter 5 Universality in Freezing Cellular Automata
  7. Altmetric Badge
    Chapter 6 A Deontic Logic Reasoning Infrastructure
  8. Altmetric Badge
    Chapter 7 Optimized Program Extraction for Induction and Coinduction
  9. Altmetric Badge
    Chapter 8 Computing Tree Width: From Theory to Practice and Back
  10. Altmetric Badge
    Chapter 9 Using Structural Properties for Integer Programs
  11. Altmetric Badge
    Chapter 10 From Eventually Different Functions to Pandemic Numberings
  12. Altmetric Badge
    Chapter 11 Divide and Conquer Computation of the Multi-string BWT and LCP Array
  13. Altmetric Badge
    Chapter 12 Some Observations on Infinitary Complexity
  14. Altmetric Badge
    Chapter 13 Taming Koepke’s Zoo
  15. Altmetric Badge
    Chapter 14 Online Computability and Differentiation in the Cantor Space
  16. Altmetric Badge
    Chapter 15 Turing’s Vision and Deep Learning
  17. Altmetric Badge
    Chapter 16 Computing and Scheduling with Explorable Uncertainty
  18. Altmetric Badge
    Chapter 17 Diminishable Parameterized Problems and Strict Polynomial Kernelization
  19. Altmetric Badge
    Chapter 18 New Nonterminal Complexity Results for Semi-conditional Grammars
  20. Altmetric Badge
    Chapter 19 Kernelization Lower Bounds for Finding Constant-Size Subgraphs
  21. Altmetric Badge
    Chapter 20 On General Sum Approximations of Irrational Numbers
  22. Altmetric Badge
    Chapter 21 Computability of Ordinary Differential Equations
  23. Altmetric Badge
    Chapter 22 Topological Analysis of Representations
  24. Altmetric Badge
    Chapter 23 A Unified Framework for Designing EPTAS’s for Load Balancing on Parallel Machines
  25. Altmetric Badge
    Chapter 24 Weak Reduction Principle and Computable Metric Spaces
  26. Altmetric Badge
    Chapter 25 Decidable and Undecidable Fragments of First-Order Concatenation Theory
  27. Altmetric Badge
    Chapter 26 Algorithm Analysis Through Proof Complexity
  28. Altmetric Badge
    Chapter 27 Computing with SAT Oracles: Past, Present and Future
  29. Altmetric Badge
    Chapter 28 The Isometry Degree of a Computable Copy of $$\ell ^p$$
  30. Altmetric Badge
    Chapter 29 Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms
  31. Altmetric Badge
    Chapter 30 A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal
  32. Altmetric Badge
    Chapter 31 The Complexity of Tukey Types and Cofinal Types
  33. Altmetric Badge
    Chapter 32 Functionals of Type 3 as Realisers of Classical Theorems in Analysis
  34. Altmetric Badge
    Chapter 33 Enumeration Degrees and Topology
  35. Altmetric Badge
    Chapter 34 A Taxonomy of Deviant Encodings
  36. Altmetric Badge
    Chapter 35 Elementary Bi-embeddability Spectra of Structures
  37. Altmetric Badge
    Chapter 36 A Generic m-Reducibility
  38. Altmetric Badge
    Chapter 37 Some Nonstandard Equivalences in Reverse Mathematics
  39. Altmetric Badge
    Chapter 38 Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract)
  40. Altmetric Badge
    Chapter 39 What Is the Concept of Computation?
  41. Altmetric Badge
    Chapter 40 Witness Hiding Without Extractors or Simulators
  42. Altmetric Badge
    Chapter 41 Algorithms and Geometric Constructions
  43. Altmetric Badge
    Chapter 42 Computing with Multisets: A Survey on Reaction Automata Theory
Attention for Chapter 3: Multiple Permitting and Array Noncomputability
Altmetric Badge
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
Multiple Permitting and Array Noncomputability
Chapter number 3
Book title
Sailing Routes in the World of Computation
Published by
Springer, Cham, July 2018
DOI 10.1007/978-3-319-94418-0_3
Book ISBNs
978-3-31-994417-3, 978-3-31-994418-0
Authors

Klaus Ambos-Spies