LEADER 05318nam 22007335 450 001 9910488690903321 005 20230515182051.0 010 $a3-030-80049-0 024 7 $a10.1007/978-3-030-80049-9 035 $a(CKB)5590000000519702 035 $a(MiAaPQ)EBC6676366 035 $a(Au-PeEL)EBL6676366 035 $a(OCoLC)1259438104 035 $a(DE-He213)978-3-030-80049-9 035 $a(PPN)257358811 035 $a(EXLCZ)995590000000519702 100 $a20210701d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aConnecting with Computability $e17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5?9, 2021, Proceedings /$fedited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (527 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12813 311 $a3-030-80048-2 327 $aSearching 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 Hindman?s 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 Their Generalizations -- 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 Ramsey?s 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12813 606 $aAlgorithms 606 $aComputer science 606 $aComputer science$xMathematics 606 $aArtificial intelligence 606 $aData structures (Computer science) 606 $aInformation theory 606 $aAlgorithms 606 $aTheory of Computation 606 $aMathematics of Computing 606 $aArtificial Intelligence 606 $aData Structures and Information Theory 606 $aComputer Science Logic and Foundations of Programming 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aArtificial intelligence. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aArtificial Intelligence. 615 24$aData Structures and Information Theory. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a511.352 702 $aDe Mol$b Liesbeth 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910488690903321 996 $aConnecting with computability$92814032 997 $aUNINA