001437919 000__ 05593cam\a2200685\i\4500
001437919 001__ 1437919
001437919 003__ OCoLC
001437919 005__ 20230309004239.0
001437919 006__ m\\\\\o\\d\\\\\\\\
001437919 007__ cr\cn\nnnunnun
001437919 008__ 210708s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001437919 019__ $$a1266811221
001437919 020__ $$a9783030800499$$q(electronic bk.)
001437919 020__ $$a3030800490$$q(electronic bk.)
001437919 020__ $$z9783030800482$$q(print)
001437919 0247_ $$a10.1007/978-3-030-80049-9$$2doi
001437919 035__ $$aSP(OCoLC)1259438104
001437919 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dEBLCP$$dOCLCF$$dDCT$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001437919 049__ $$aISEA
001437919 050_4 $$aQA9.59$$b.C67 2021eb
001437919 08204 $$a511.3/52$$223
001437919 1112_ $$aConference on Computability in Europe$$n(17th :$$d2021 :$$cOnline)
001437919 24510 $$aConnecting with computability :$$b17th Conference on Computability in Europe, CiE 2021, virtual event, Ghent, July 5-9, 2021, Proceedings /$$cLiesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque (eds.).
001437919 2463_ $$aCiE 2021
001437919 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2021]
001437919 300__ $$a1 online resource (xxiv, 506 pages) :$$billustrations (some color)
001437919 336__ $$atext$$btxt$$2rdacontent
001437919 337__ $$acomputer$$bc$$2rdamedia
001437919 338__ $$aonline resource$$bcr$$2rdacarrier
001437919 347__ $$atext file
001437919 347__ $$bPDF
001437919 4901_ $$aLecture notes in computer science ;$$v12813
001437919 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001437919 500__ $$aIncludes author index.
001437919 5050_ $$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.
001437919 506__ $$aAccess limited to authorized users.
001437919 520__ $$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.
001437919 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed July 8, 2021).
001437919 650_0 $$aComputable functions$$vCongresses.
001437919 650_0 $$aComputer science$$xMathematics$$vCongresses.
001437919 650_6 $$aFonctions calculables$$vCongrès.
001437919 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001437919 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001437919 655_7 $$aConference papers and proceedings.$$2lcgft
001437919 655_7 $$aActes de congrès.$$2rvmgf
001437919 655_0 $$aElectronic books.
001437919 7001_ $$aDe Mol, Liesbeth,$$eeditor.
001437919 7001_ $$aWeiermann, Andreas,$$eeditor.
001437919 7001_ $$aManea, Florin,$$eeditor$$1https://orcid.org/0000-0001-6094-3324
001437919 7001_ $$aFernández-Duque, David,$$eeditor.
001437919 77608 $$iPrint version: $$z9783030800482
001437919 77608 $$iPrint version: $$z9783030800505
001437919 830_0 $$aLecture notes in computer science ;$$v12813.
001437919 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001437919 852__ $$bebk
001437919 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-80049-9$$zOnline Access$$91397441.1
001437919 909CO $$ooai:library.usi.edu:1437919$$pGLOBAL_SET
001437919 980__ $$aBIB
001437919 980__ $$aEBOOK
001437919 982__ $$aEbook
001437919 983__ $$aOnline
001437919 994__ $$a92$$bISE