Kansikuva

Twenty Years of Theoretical and Practical Synergies 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings /

This 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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Yhteisötekijä: SpringerLink (Online service)
Muut tekijät: Levy Patey, Ludovic (Toimittaja), Pimentel, Elaine (Toimittaja), Galeotti, Lorenzo (Toimittaja), Manea, Florin (Toimittaja)
Aineistotyyppi: Elektroninen E-kirja
Kieli:englanti
Julkaistu: Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
Painos:1st ed. 2024.
Sarja:Lecture Notes in Computer Science, 14773
Aiheet:
Algorithms.
Linkit:https://doi.org/10.1007/978-3-031-64309-5
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
Sisällysluettelo:
  • -- 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.

Samankaltaisia teoksia