Beyond the horizon of computability : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020, Proceedings /: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020, Proceedings. (2020)

• Record Type: Book
• Other Titles: CiE 2020
• Further Information: Note: Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly (eds.).
• Other Names: Anselmo, Marcella; Della Vedova, Gianluca; Manea, Florin; Pauly, Arno; Conference on Computability in Europe, 16th
• 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 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 Łukasiewicz 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 th e Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case.
• Publisher Details: Cham : Springer
• Publication Date: 2020
• Extent: 1 online resource
• Subjects: 511.3/52; Computable functions -- Congresses; Computer science -- Mathematics -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030514662; 3030514668
• Related ISBNs: 303051465X; 9783030514655
• Notes: Note: Includes bibliographical references and author index.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.