國立虎尾科技大學 |

Connecting with Computability = 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Connecting with Computability/ edited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque.
其他題名:	17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings /
其他作者:	De Mol, Liesbeth.
面頁冊數:	XXIV, 506 p. 30 illus., 16 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-80049-9
ISBN:	9783030800499

Connecting with Computability = 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings /
Connecting with Computability17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings /[electronic resource] :edited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque. - 1st ed. 2021. - XXIV, 506 p. 30 illus., 16 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12813. - Theoretical Computer Science and General Issues ;9163.

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

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.

ISBN: 9783030800499

Standard No.: 10.1007/978-3-030-80049-9doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

Connecting with Computability = 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings /
LDR:04345nam a22004095i 4500 001 1046641
003 DE-He213
005 20210826202919.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030800499 $9 978-3-030-80049-9
024 7 $a 10.1007/978-3-030-80049-9 $2 doi
035 $a 978-3-030-80049-9
050 4 $a QA76.9.A43
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518.1 $2 23
245 1 0 $a Connecting with Computability $h [electronic resource] : $b 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings / $c edited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXIV, 506 p. 30 illus., 16 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12813
505 0 $a 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 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Artificial intelligence. $3 559380
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer logic. $3 786340
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Logics and Meanings of Programs. $3 670058
700 1 $a De Mol, Liesbeth. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1211971
700 1 $a Weiermann, Andreas. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1316085
700 1 $a Manea, Florin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1067820
700 1 $a Fernández-Duque, David. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1350215
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030800482
776 0 8 $i Printed edition: $z 9783030800505
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-80049-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)