Beyond the Horizon of Computability

A Note on Computable Embeddings for Ordinals and Their Reverses.- Clockability for Ordinal Turing Machines.- Some notes on spaces of ideals and computable topology.- Parallelizations in Weihrauch reducibility and constructive reverse mathematics.- Liouville Numbers and the Computational Complexity of Changing Bases.- On Interpretability between some weak essential undecidable theories.- On the Complexity of Conversion between Classic Real Number Representations.- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power.- Computable analysis and classification problems.- Non-coding enumeration operators.- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings.- An interactive proof system for Program extraction.- ASNP: a tame fragment of existential second-order logic.- Ackermannian Goodstein sequences of intermediate growth.- On the complexity of validity degrees in Lukasiewicz logic.- Degrees of non-computability of homeomorphism types of Polish spaces.- Time-aware uniformization of winning strategies.- Quantitative Representation Theory of Compact Metric Spaces.- Functions of Baire class one over a Bishop topology.- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences.- The Computational Significance of Hausdorff's Maximal Chain Principle.- Prefix of trace languages: clique polynomials and dependency graphs.- Repetitions in Toeplitz words and the Thue threshold.- Simulation of automata networks.- Theoretical and Implementation Aspects of the Formal Language Server (LaSer).- Balancing Straight-Line Programs for Strings and Trees.- Two-dimensional codes.- Formal Languages in Graph Databases and Information Extraction.- On the perceptron's compression.- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method.- Faster Online Computation of the Succinct Longest Previous