Cantitate/Preț
Produs
Total produse
Vezi coșul
Unity of Logic and Computation: 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings de Gianluca Della Vedova

Unity of Logic and Computation: 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13967

Editat de Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea
en Limba Engleză Paperback – 19 iul 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 41208 lei

Preț vechi: 51511 lei
-20% Nou

Puncte Express: 618
Preț estimativ în valută:
7889€ • 8200$ • 6541£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031369773
ISBN-10: 3031369777
Ilustrații: LI, 297 p. 32 illus., 11 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.49 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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