東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Unity of logic and computation = 19t...

Conference on Computability in Europe (2023 :)

Linked to FindBook

Google Book

Amazon

博客來

Unity of logic and computation = 19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Unity of logic and computation/ edited by Gianluca Della Vedova ... [et al.].
Reminder of title:	19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings /
remainder title:	CIE 2023
other author:	Della Vedova, Gianluca.
corporate name:	Conference on Computability in Europe
Published:	Cham :Springer Nature Switzerland : : 2023.,
Description:	li, 297 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Computable functions - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-36978-0
ISBN:	9783031369780

Unity of logic and computation = 19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings /
Unity of logic and computation19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings /[electronic resource] :CIE 2023edited by Gianluca Della Vedova ... [et al.]. - Cham :Springer Nature Switzerland :2023. - li, 297 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,139670302-9743 ;. - Lecture notes in computer science ;13967..

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.

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

ISBN: 9783031369780

Standard No.: 10.1007/978-3-031-36978-0doiSubjects--Topical Terms:

725762
Computable functions
--Congresses.

LC Class. No.: QA9.59

Dewey Class. No.: 511.352

Unity of logic and computation = 19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings /
LDR:03146nmm a2200349 a 4500 001 2332813
003 DE-He213
005 20230718124054.0
006 m d
007 cr nn 008maaau
008 240402s2023 sz s 0 eng d
020 $a 9783031369780 $q (electronic bk.)
020 $a 9783031369773 $q (paper)
024 7 $a 10.1007/978-3-031-36978-0 $2 doi
035 $a 978-3-031-36978-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.59
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 511.352 $2 23
090 $a QA9.59 $b .C748 2023
111 2 $a Conference on Computability in Europe $n (19th : $d 2023 : $c Batumi, Georgia) $3 3663013
245 1 0 $a Unity of logic and computation $h [electronic resource] : $b 19th Conference on Computability in Europe, CIE 2023, Batumi, Georgia, July 24-28, 2023 : proceedings / $c edited by Gianluca Della Vedova ... [et al.].
246 3 $a CIE 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a li, 297 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13967
505 0 $a 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.
520 $a This 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.
650 0 $a Computable functions $x Congresses. $3 725762
650 0 $a Computer science $x Mathematics $x Congresses. $3 678603
650 1 4 $a Algorithms. $3 536374
700 1 $a Della Vedova, Gianluca. $3 3663014
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13967. $3 3663015
856 4 0 $u https://doi.org/10.1007/978-3-031-36978-0
950 $a Computer Science (SpringerNature-11645)