Beyond the Horizon of Computability

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 A Note on Computable Embeddings for Ordinals and Their Reverses
3. Altmetric Badge
   Chapter 2 Clockability for Ordinal Turing Machines
4. Altmetric Badge
   Chapter 3 Some Notes on Spaces of Ideals and Computable Topology
5. Altmetric Badge
   Chapter 4 Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics
6. Altmetric Badge
   Chapter 5 Liouville Numbers and the Computational Complexity of Changing Bases
7. Altmetric Badge
   Chapter 6 On Interpretability Between Some Weak Essentially Undecidable Theories
8. Altmetric Badge
   Chapter 7 On the Complexity of Conversion Between Classic Real Number Representations
9. Altmetric Badge
   Chapter 8 Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
10. Altmetric Badge
    Chapter 9 Computable Analysis and Classification Problems
11. Altmetric Badge
    Chapter 10 Non-coding Enumeration Operators
12. Altmetric Badge
    Chapter 11 On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings
13. Altmetric Badge
    Chapter 12 Prawf : An Interactive Proof System for Program Extraction
14. Altmetric Badge
    Chapter 13 ASNP: A Tame Fragment of Existential Second-Order Logic
15. Altmetric Badge
    Chapter 14 Ackermannian Goodstein Sequences of Intermediate Growth
16. Altmetric Badge
    Chapter 15 On the Complexity of Validity Degrees in Łukasiewicz Logic
17. Altmetric Badge
    Chapter 16 Degrees of Non-computability of Homeomorphism Types of Polish Spaces
18. Altmetric Badge
    Chapter 17 Time-Aware Uniformization of Winning Strategies
19. Altmetric Badge
    Chapter 18 Quantitative Coding and Complexity Theory of Compact Metric Spaces
20. Altmetric Badge
    Chapter 19 Functions of Baire Class One over a Bishop Topology
21. Altmetric Badge
    Chapter 20 Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays
22. Altmetric Badge
    Chapter 21 The Computational Significance of Hausdorff’s Maximal Chain Principle
23. Altmetric Badge
    Chapter 22 Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs
24. Altmetric Badge
    Chapter 23 Repetitions in Toeplitz Words and the Thue Threshold
25. Altmetric Badge
    Chapter 24 On Simulation in Automata Networks
26. Altmetric Badge
    Chapter 25 Theoretical and Implementational Aspects of the Formal Language Server (LaSer)
27. Altmetric Badge
    Chapter 26 Balancing Straight-Line Programs for Strings and Trees
28. Altmetric Badge
    Chapter 27 Two-Dimensional Codes
29. Altmetric Badge
    Chapter 28 Formal Languages in Information Extraction and Graph Databases
30. Altmetric Badge
    Chapter 29 On the Perceptron’s Compression
31. Altmetric Badge
    Chapter 30 #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
32. Altmetric Badge
    Chapter 31 Faster Online Computation of the Succinct Longest Previous Factor Array
33. Altmetric Badge
    Chapter 32 Recent Advances in Text-to-Pattern Distance Algorithms
34. Altmetric Badge
    Chapter 33 Insertion-Deletion Systems with Substitutions I