<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>05696nam a22005295i 4500</leader>
  <controlfield tag="001">978-3-031-64309-5</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20251030112609.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">240702s2024    sz |    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9783031643095</subfield>
    <subfield code="9">978-3-031-64309-5</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/978-3-031-64309-5</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
    <subfield code="a">QA76.9.A43</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UMB</subfield>
    <subfield code="2">bicssc</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">COM051300</subfield>
    <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UMB</subfield>
    <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Twenty Years of Theoretical and Practical Synergies</subfield>
    <subfield code="h">[electronic resource] :</subfield>
    <subfield code="b">20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8&#x2013;12, 2024, Proceedings /</subfield>
    <subfield code="c">edited by Ludovic Levy Patey, Elaine Pimentel, Lorenzo Galeotti, Florin Manea.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1st ed. 2024.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Cham :</subfield>
    <subfield code="b">Springer Nature Switzerland :</subfield>
    <subfield code="b">Imprint: Springer,</subfield>
    <subfield code="c">2024.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">XXXIX, 462 p. 31 illus., 10 illus. in color.</subfield>
    <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14773</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="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&#x2013;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&gt;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&#xFC;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.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This book constitutes the refereed proceedings of the 20th Conference on Computabilitty in Europe, CiE 2024, held in Amsterdam, The Netherlands, during July 8&#x2013;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.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Algorithms.</subfield>
    <subfield code="9">58677</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
    <subfield code="a">Algorithms.</subfield>
    <subfield code="9">58677</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Levy Patey, Ludovic.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="0">(orcid)0000-0002-0304-7926</subfield>
    <subfield code="1">https://orcid.org/0000-0002-0304-7926</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">79889</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Pimentel, Elaine.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="0">(orcid)0000-0002-7113-0801</subfield>
    <subfield code="1">https://orcid.org/0000-0002-7113-0801</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">79890</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Galeotti, Lorenzo.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">79891</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Manea, Florin.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="0">(orcid)0000-0001-6094-3324</subfield>
    <subfield code="1">https://orcid.org/0000-0001-6094-3324</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">34710</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Springer Nature eBook</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031643088</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031643101</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14773</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://doi.org/10.1007/978-3-031-64309-5</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SXCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-LNC</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">61276</subfield>
    <subfield code="d">61276</subfield>
  </datafield>
</record>
