000 05564nam a22005295i 4500
001 978-3-031-64309-5
003 DE-He213
005 20240730172704.0
007 cr nn 008mamaa
008 240702s2024 sz | s |||| 0|eng d
020 _a9783031643095
_9978-3-031-64309-5
024 7 _a10.1007/978-3-031-64309-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aTwenty Years of Theoretical and Practical Synergies
_h[electronic resource] :
_b20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8-12, 2024, Proceedings /
_cedited by Ludovic Levy Patey, Elaine Pimentel, Lorenzo Galeotti, Florin Manea.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXXXIX, 462 p. 31 illus., 10 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14773
505 0 _a -- Invited abstracts. -- Special Session: Computing Knowledge: Computational Aspects of Epistemic Logics (HaPoC). -- The theory of enumeration degrees and its fragments. -- Further extensions of the point to set principle. -- Uniform distribution and algorithmic randomness. -- Computable aspects of symbolic dynamics and tilings. -- How much pattern complexity can help us solve the domino problem ?. -- Sufficient conditions for non-emptiness of a subshift and computability of its entropy. -- Reasoning about (Negative) Trust under Uncertainty. -- Quantum computating from reversible classical computing. -- Complexity of well-ordered sets in an ordered Abelian group. -- Invited papers. -- If CiE Did not Exist, It Would be Necessary to Invent It. -- Some Open Questions and Recent Results on Computable Banach Spaces. -- Kolmogorov complexity as a combinatorial tool. -- Cellular Automata: Communication Matters. -- Membership problems in infinite groups. -- Communication Modalities. -- Algorithmic aspects of left-orderings of solvable Baumslag-Solitar groups via its dynamical realization. -- Hybrid Maximal Filter Spaces. -- Inversion in P-computable fields. -- Regular papers. -- On the computational properties of weak continuity notions. -- On Arithmetical Numberings in Reverse Mathematics. -- Two-player Domino games. -- Almost sure OTM-realizability. -- Learning Families of Algebraic Structures from Text. -- Structures of Finite Punctual Dimension n>2. -- Counting Simple Rules in Semi-Conditional Grammars Is Not Simple. -- Universal Boolean algebras with applications to semantic classes of models. -- Existential Definability of Unary Predicates in Büchi Arithmetic. -- Graph Homomorphism, Monotone Classes and Bounded Pathwidth. -- Recursion-Theoretic Alternation. -- Computable structure theory of partial combinatory algebras. -- Hyperarithmetic Numerals. -- Lipschitz determinacy and Arithmetic Transfinite Recursion. -- Higher-order feedback computation. -- Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability. -- Fundamental Sequences based on Localization. -- The weakness of finding descending sequences in ill-founded linear orders. -- Sequential Discontinuity and First-Order Problems. -- Complexities of Theories of Profinite Subgroups of $S_\omega$ via Tree Presentations. -- The theory of Hilbert's Basis Theorem for multivariate polynomials over rings. -- A Weak First-Order Theory of Sequences. -- On the group of computable automorphisms of the linear order of the reals. -- A diamond embedding theorem in the quotient structure ${\bf R}/\Ncup$. -- The Decision Problem for Undirected Graphs with Reachability and Acyclicity. -- Isometric Sets of Words and Generalizations of the Fibonacci Cubes.
520 _aThis book constitutes the refereed proceedings of the 20th Conference on Computabilitty in Europe, CiE 2024, held in Amsterdam, The Netherlands, during July 8-12, 2024 The 26 full papers and 2 short papers included in this book were carefully reviewed and selected from 43 submissions. This CIE 2024 focus on development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences.
650 0 _aAlgorithms.
_93390
650 1 4 _aAlgorithms.
_93390
700 1 _aLevy Patey, Ludovic.
_eeditor.
_0(orcid)
_10000-0002-0304-7926
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9105038
700 1 _aPimentel, Elaine.
_eeditor.
_0(orcid)
_10000-0002-7113-0801
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9105040
700 1 _aGaleotti, Lorenzo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9105041
700 1 _aManea, Florin.
_eeditor.
_0(orcid)
_10000-0001-6094-3324
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9105043
710 2 _aSpringerLink (Online service)
_9105046
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031643088
776 0 8 _iPrinted edition:
_z9783031643101
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14773
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-64309-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c88484
_d88484