000			04485nam a22005535i 4500
001			978-3-031-36978-0
003			DE-He213
005			20240207153734.0
007			cr nn 008mamaa
008			230718s2023 sz | s |||| 0|eng d
020			_a9783031369780 _9978-3-031-36978-0
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	_aUnity of Logic and Computation _h[electronic resource] : _b19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings / _cedited by Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea.
250			_a1st ed. 2023.
264		1	_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2023.
300			_aLI, 297 p. 32 illus., 11 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 ; _v13967
500			_aAcceso multiusuario
505	0		_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 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.
520			_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.
541			_fUABC ; _cPerpetuidad
650		0	_aAlgorithms.
650	1	4	_aAlgorithms.
700	1		_aDella Vedova, Gianluca. _eeditor. _0(orcid)0000-0001-5584-3089 _1https://orcid.org/0000-0001-5584-3089 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aDundua, Besik. _eeditor. _0(orcid)0000-0003-4754-4163 _1https://orcid.org/0000-0003-4754-4163 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aLempp, Steffen. _eeditor. _0(orcid)0000-0002-2958-4017 _1https://orcid.org/0000-0002-2958-4017 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aManea, Florin. _eeditor. _0(orcid)0000-0001-6094-3324 _1https://orcid.org/0000-0001-6094-3324 _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783031369773
776	0	8	_iPrinted edition: _z9783031369797
830		0	_aLecture Notes in Computer Science, _x1611-3349 ; _v13967
856	4	0	_zLibro electrónico _uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-36978-0
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cLIBRO_ELEC
999			_c263058 _d263057