단행본 상세

서지주요정보
Unity of Logic and Computation: 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings
서명 / 저자 Unity of Logic and Computation [electronic resource] : 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings / edited by Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea.
저자명 Della Vedova, Gianluca. editor. (orcid)0000-0001-5584-3089 https://orcid.org/0000-0001-5584-3089 edt http://id.loc.gov/vocabulary/relators/edt ; Dundua, Besik. editor. (orcid)0000-0003-4754-4163 https://orcid.org/0000-0003-4754-4163 edt http://id.loc.gov/vocabulary/relators/edt ; Lempp, Steffen. editor. (orcid)0000-0002-2958-4017 https://orcid.org/0000-0002-2958-4017 edt http://id.loc.gov/vocabulary/relators/edt ; Manea, Florin. editor. (orcid)0000-0001-6094-3324 https://orcid.org/0000-0001-6094-3324 edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
판사항 1st ed. 2023.
발행사항 Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
총서명 Lecture Notes in Computer Science, 1611-3349 ; 13967
Online Access https://doi.org/10.1007/978-3-... URL

서지기타정보

서지기타정보
ISBN 9783031369780
기타 표준번호 10.1007/978-3-031-36978-0
청구기호 QA76.9.A43
형태사항 LI, 297 p. 32 illus., 11 illus. in color. online resource.
언어 English
내용 Degree 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 Weihrauch complexity 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.
주제 Algorithms.
Algorithms.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783031369773 Printed edition: 9783031369797
QR CODE