Beyond the Horizon of Computability

1. Front Matter

   Pages i-xxxvii

   PDF

2. A Note on Computable Embeddings for Ordinals and Their Reverses

   • Nikolay Bazhenov, Stefan Vatev

   Pages 1-13

3. Clockability for Ordinal Turing Machines

   • Merlin Carl

   Pages 14-25

4. Some Notes on Spaces of Ideals and Computable Topology

   • Matthew de Brecht

   Pages 26-37

5. Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics

   • Makoto Fujiwara

   Pages 38-49

6. Liouville Numbers and the Computational Complexity of Changing Bases

   • Sune Kristian Jakobsen, Jakob Grue Simonsen

   Pages 50-62

7. On Interpretability Between Some Weak Essentially Undecidable Theories

   • Lars Kristiansen, Juvenal Murwanashyaka

   Pages 63-74

8. On the Complexity of Conversion Between Classic Real Number Representations

   • Lars Kristiansen, Jakob Grue Simonsen

   Pages 75-86

9. Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power

   • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano

   Pages 87-99

10. Computable Analysis and Classification Problems

    • Rodney G. Downey, Alexander G. Melnikov

    Pages 100-111

11. Non-coding Enumeration Operators

    • Russell Miller

    Pages 112-123

12. On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings

    • Thomas Zeugmann

    Pages 124-136

13. Prawf: An Interactive Proof System for Program Extraction

    • Ulrich Berger, Olga Petrovska, Hideki Tsuiki

    Pages 137-148

14. ASNP: A Tame Fragment of Existential Second-Order Logic

    • Manuel Bodirsky, Simon Knäuer, Florian Starke

    Pages 149-162

15. Ackermannian Goodstein Sequences of Intermediate Growth

    • David Fernández-Duque, Andreas Weiermann

    Pages 163-174

16. On the Complexity of Validity Degrees in Łukasiewicz Logic

    • Zuzana Haniková

    Pages 175-188

17. Degrees of Non-computability of Homeomorphism Types of Polish Spaces

    • Mathieu Hoyrup, Takayuki Kihara, Victor Selivanov

    Pages 189-192

18. Time-Aware Uniformization of Winning Strategies

    • Stéphane Le Roux

    Pages 193-204

19. Quantitative Coding and Complexity Theory of Compact Metric Spaces

    • Donghyun Lim, Martin Ziegler

    Pages 205-214

20. Functions of Baire Class One over a Bishop Topology

    • Iosif Petrakis

    Pages 215-227

This book constitutes the proceedings of the 16th Conference on Computability in Europe, CiE 2020, which was planned to be held in Fisciano, Italy, during June 29 until July 3, 2020. The conference moved to a virtual format due to the coronavirus pandemic. 
The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2020 had as its motto Beyond the Horizon of Computability, reflecting the interest of CiE in research transgressing the traditional boundaries of computability theory.

• artificial intelligence
• automata theory
• communication systems
• computational linguistics
• computer hardware
• computer networks
• computer science
• computer systems
• databases
• engineering
• formal languages
• formal logic
• graph theory
• internet
• linguistics
• mathematics
• network protocols
• semantics
• signal processing
• theoretical computer science

• University of Salerno, Fisciano, Italy

  Marcella Anselmo

• University of Milano-Bicocca, Milan, Italy

  Gianluca Della Vedova

• University of Göttingen, Göttingen, Germany

  Florin Manea

• Swansea University, Swansea, UK

  Arno Pauly

Policies and ethics