LEADER 05707nam 22007575 450 001 996418315203316 005 20230330063008.0 010 $a3-030-51466-8 024 7 $a10.1007/978-3-030-51466-2 035 $a(CKB)5310000000016579 035 $a(MiAaPQ)EBC6235488 035 $a(DE-He213)978-3-030-51466-2 035 $a(PPN)24859544X 035 $a(EXLCZ)995310000000016579 100 $a20200623d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aBeyond the Horizon of Computability$b[electronic resource] $e16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29?July 3, 2020, Proceedings /$fedited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (xxxvii, 378 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12098 300 $aIncludes index. 311 $a3-030-51465-X 327 $aA 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 the Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12098 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer networks 606 $aArtificial intelligence 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aMathematics of Computing 606 $aComputer Communication Networks 606 $aArtificial Intelligence 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aComputer Communication Networks. 615 24$aArtificial Intelligence. 676 $a511.352 702 $aAnselmo$b Marcella$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDella Vedova$b Gianluca$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aManea$b Florin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPauly$b Arno$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418315203316 996 $aBeyond the Horizon of Computability$92224678 997 $aUNISA