LEADER 03716nam 22005535 450 001 9910735387303321 005 20250728174729.0 010 $a9783031369780 010 $a3031369785 024 7 $a10.1007/978-3-031-36978-0 035 $a(CKB)27671043900041 035 $a(MiAaPQ)EBC30654995 035 $a(Au-PeEL)EBL30654995 035 $a(DE-He213)978-3-031-36978-0 035 $a(PPN)272249947 035 $a(OCoLC)1390918769 035 $a(EXLCZ)9927671043900041 100 $a20230718d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aUnity of Logic and Computation $e19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24?28, 2023, Proceedings /$fedited by Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (327 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13967 311 08$a9783031369773 327 $aDegree theory -- Cupping computably enumerable degrees simultaneously -- The relationship between local and global structure in the enumeration degrees -- A directed system of Scott ideals -- Proof Theory -- The non-normal abyss in Kleene's computability theory -- A Constructive Picture of Noetherianity and Well Quasi-Orders -- Computability -- Symmetry for transfinite computability -- All Melodies are Lost -- Recognizability for weak and strong ?-ITRMs -- The de Groot dual of represented spaces -- Algorithmic Randomness -- Some Games on Turing Machines and Power from Random Strings -- Inequalities for entropies and dimensions -- Computational Complexity -- Elementarily traceable irrational numbers -- Logic vs topology on regular ?-languages -- Subrecursive Graphs of Representations of Irrational Numbers -- On the complexity of learning programs -- The Weihrauchcomplexity of the supergraph problem -- Extending Wagner's hierarchy to Deterministic Visibly Pushdown Automata -- On guarded extensions of MMSNP -- Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics -- Interactive proofs -- Structural Complexity of Rational Interactive Proofs -- Physical Zero-Knowledge Proof for Ball Sort Puzzle -- Combinatorial approaches -- Graph subshifts -- Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games -- An O(?k)-approximation algorithm for minimum power k edge disjoint st-paths. 330 $aThis book constitutes the refereed proceedings of the 19th International Conference on Unity of Logic and Computation, CiE 2023, held in Batumi, Georgia, during July 24?28, 2023. The 23 full papers and 13 invited papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: Degree theory; Proof Theory; Computability; Algorithmic Randomness; Computational Complexity; Interactive proofs; and Combinatorial approaches. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13967 606 $aAlgorithms 606 $aAlgorithms 615 0$aAlgorithms. 615 14$aAlgorithms. 676 $a004 676 $a004 700 $aDella Vedova$b Gianluca$01376492 701 $aDundua$b Besik$01376493 701 $aLempp$b Steffen$01376494 701 $aManea$b Florin$01376495 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910735387303321 996 $aUnity of Logic and Computation$93412350 997 $aUNINA