Cantitate/Preț
Produs
Total produse
Vezi coșul
Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings de Marcella Anselmo

Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12098

Editat de Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly
en Limba Engleză Paperback – 24 iun 2020
This book constitutes the proceedings of the 16th Conference on Computability in Europe, CiE 2020, which was planned to be held in Fisciano, Italy, during June 29 until July 3, 2020. The conference moved to a virtual format due to the coronavirus pandemic. 

The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2020 had as its motto Beyond the Horizon of Computability, reflecting the interest of CiE in research transgressing the traditional boundaries of computability theory.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32051 lei

Preț vechi: 40064 lei
-20% Nou

Puncte Express: 481
Preț estimativ în valută:
6136€ • 6663$ • 5160£

Carte tipărită la comandă

Livrare economică 17-31 decembrie

 Adaugă în coș

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

Specificații

ISBN-13: 9783030514655
ISBN-10: 303051465X
Pagini: 300
Ilustrații: XXXVII, 379 p. 21 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.59 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

A Note on Computable Embeddings for Ordinals and Their Reverses.- Clockability for Ordinal Turing Machines.- Some notes on spaces of ideals and computable topology.- Parallelizations in Weihrauch reducibility and constructive reverse mathematics.- Liouville Numbers and the Computational Complexity of Changing Bases.- On Interpretability between some weak essential undecidable theories.- On the Complexity of Conversion between Classic Real Number Representations.- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power.- Computable analysis and classification problems.- Non-coding enumeration operators.- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings.- An interactive proof system for Program extraction.- ASNP: a tame fragment of existential second-order logic.- Ackermannian Goodstein sequences of intermediate growth.- On the complexity of validity degrees in Łukasiewicz logic.- Degrees of non-computability of homeomorphism types of Polish spaces.- Time-aware uniformization of winning strategies.- Quantitative Representation Theory of Compact Metric Spaces.- Functions of Baire class one over a Bishop topology.- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences.- The Computational Significance of Hausdorff's Maximal Chain Principle.- Prefix of trace languages: clique polynomials and dependency graphs.- Repetitions in Toeplitz words and the Thue threshold.- Simulation of automata networks.- Theoretical and Implementation Aspects of the Formal Language Server (LaSer).- Balancing Straight-Line Programs for Strings and Trees.- Two-dimensional codes.- Formal Languages in Graph Databases and Information Extraction.- On the perceptron's compression.- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method.- Faster Online Computation of the Succinct Longest Previous Factor Array.- Recent advances in text-to-pattern distance algorithms.- Insertion-Deletion Systems With Substitutions: The Context-free Case.