000 05663nam a22006495i 4500
001 978-3-030-51466-2
003 DE-He213
005 20240730174236.0
007 cr nn 008mamaa
008 200623s2020 sz | s |||| 0|eng d
020 _a9783030514662
_9978-3-030-51466-2
024 7 _a10.1007/978-3-030-51466-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aBeyond the Horizon of Computability
_h[electronic resource] :
_b16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020, Proceedings /
_cedited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXXXVII, 379 p. 21 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12098
505 0 _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.
520 _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.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9111696
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence.
_93407
650 1 4 _aTheory of Computation.
_9111697
650 2 4 _aFormal Languages and Automata Theory.
_9111698
650 2 4 _aAlgorithms.
_93390
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aComputer Communication Networks.
_9111699
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aAnselmo, Marcella.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9111700
700 1 _aDella Vedova, Gianluca.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9111701
700 1 _aManea, Florin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9111702
700 1 _aPauly, Arno.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9111703
710 2 _aSpringerLink (Online service)
_9111704
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030514655
776 0 8 _iPrinted edition:
_z9783030514679
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12098
_9111705
856 4 0 _uhttps://doi.org/10.1007/978-3-030-51466-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89333
_d89333