Atjaunināt sīkdatņu piekrišanu

Connecting with Computability: 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 59, 2021, Proceedings 1st ed. 2021 [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 506 pages, height x width: 235x155 mm, weight: 807 g, 16 Illustrations, color; 14 Illustrations, black and white; XXIV, 506 p. 30 illus., 16 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12813
  • Izdošanas datums: 02-Jul-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030800482
  • ISBN-13: 9783030800482
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Connecting with Computability: 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 59, 2021, Proceedings 1st ed. 2021Palielināt
  • Formāts: Paperback / softback, 506 pages, height x width: 235x155 mm, weight: 807 g, 16 Illustrations, color; 14 Illustrations, black and white; XXIV, 506 p. 30 illus., 16 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12813
  • Izdošanas datums: 02-Jul-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030800482
  • ISBN-13: 9783030800482
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783030800482.html
This book constitutes the proceedings of the 17th Conference on Computability in Europe, CiE 2021, organized by the University of Ghent in July 2021. Due to COVID-19 pandemic the conference was held virtually.

The 48 full papers presented in this volume were carefully reviewed and selected from 50 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 2021 had as its motto Connecting with Computability, a clear acknowledgement of the connecting and interdisciplinary nature of the conference series which is all the more important in a time where people are more than ever disconnected from one another due to the COVID-19 pandemic.

Searching for Applicable Versions of Computable Structures.- On Measure
Quantifiers in First-Order Arithmetic.- Pistone Learning Languages with
Decidable Hypotheses.- Robust Online Algorithms for Dynamic Choosing
Problems.- On the degrees of constructively immune sets.- Fine-Grained
Complexity Theory: Conditional Lower Bounds for Computational Geometry.- The
Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines.- Randomising
Realizability.- Restrictions of Hindmans Theorem: an overview.- Complexity
and Categoricity of Automatic Injection structures.- A tale of optimizing the
space taken by de Bruijn graphs.- Formally Computing with the
Non-Computable.- Cohen Mapping Monotonic Restrictions in Inductive
Inference.- Normal Forms for Semantically Witness-Based Learners in Inductive
Inference.- xWalk-preserving transformation of overlapped sequence graphs
into blunt sequence graphs with GetBlunted.- On 3SUM-hard problems in the
Decision Tree Model.- Monotonic Spectra and TheirGeneralizations.- On false
Heine/Borel compactness principles in proof mining.- Placing Green Bridges
Optimally, with a Multivariate Analysis.- A Church-Turing thesis for
randomness? .- Probabilistic Models of k-mer Frequencies.- Defining Formal
Explanation in Classical Logic by Substructural Derivability.- Dedekind Cuts
and Long Strings of Zeros in Base Expansions.- On the impact of treewidth in
the computational complexity of freezing dynamics.- Towards a Map for
Incremental Learning in the Limit from Positive and Negative Information.- On
preserving the computational content of mathematical proofs: toy examples for
a formalising strategy.- n search of the first-order part of Ramseys theorem
for pairs.- On subrecursive representability of irrational numbers:
Contractors and Baire sequences.- xiLearning.- Languages in the Limit from
Positive Information with Finitely Many Memory Changes.