Description 
1 online resource 
Series 
LNCS Sublibrary: SL 1, Theoretical Computer Science and General Issues 

Lecture notes in computer science ; 12098 

LNCS sublibrary. SL 1, Theoretical computer science and general issues


Lecture notes in computer science ; 12098

Contents 
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 FiniteState Transducers: Computational and Descriptional Power  Computable analysis and classification problems  Noncoding 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 secondorder logic  Ackermannian Goodstein sequences of intermediate growth  On the complexity of validity degrees in Ćukasiewicz logic  Degrees of noncomputability of homeomorphism types of Polish spaces  Timeaware 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 3uniform 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 StraightLine Programs for Strings and Trees  Twodimensional codes  Formal Languages in Graph Databases and Information Extraction  On the perceptron's compression  #Pcompleteness of counting update digraphs, cacti, and seriesparallel decomposition method  Faster Online Computation of th e Succinct Longest Previous Factor Array  Recent advances in texttopattern distance algorithms  InsertionDeletion Systems With Substitutions: The Contextfree Case 
Summary 
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 computabilityrelated 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 
Notes 
"CiE 2020 was the 16th conference in the series, and the first one to take place virtually. If not for the COVID19 pandemic, CiE 2020 would have taken place in Salerno, Italy." 

International conference proceedings 
Bibliography 
Includes bibliographical references and author index 
Subject 
Computable functions  Congresses


Computer science  Mathematics  Congresses.


Algorithms.


Computable functions.


Computer science  Mathematics.

Genre/Form 
Conference papers and proceedings.

Form 
Electronic book

Author 
Anselmo, Marcella.


Della Vedova, Gianluca.


Manea, Florin.


Pauly, Arno.

ISBN 
3030514668 

9783030514662 
