000 05810nam a22006375i 4500
001 978-3-319-94418-0
003 DE-He213
005 20210201191320.0
007 cr nn 008mamaa
008 180704s2018 gw | s |||| 0|eng d
020 _a9783319944180
_9978-3-319-94418-0
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aUFM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aSailing Routes in the World of Computation
_h[electronic resource] :
_b14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings /
_cedited by Florin Manea, Russell G. Miller, Dirk Nowotka.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXV, 434 p. 28 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v10936
500 _aAcceso multiusuario
505 0 _aA Journey To Computably Enumerable Structures (Tutorial Lectures) -- Polynomial-time Presentations of Algebraic Number Fields (Extended abstract) -- Multiple Permitting and Array Noncomputability -- Degrees of Categoricity for Prime and Homogeneous Models -- Universality in Freezing Cellular Automata -- A Deontic Logic Reasoning Infrastructure -- Optimised Program Extraction for Induction and Coinduction -- Computing Tree Width: From Theory to Practice and Back -- Using Structural Properties for Integer Programs -- From Eventually Different Functions to Pandemic Numberings -- Divide and Conquer Computation of the Multi-String BWT and LCP Array -- Some Observations on Infinitary Complexity -- Taming Koepke's Zoo -- Online Computability and Differentiation in the Cantor Space -- Turing's Vision and Deep Learning -- Computing and Scheduling with Explorable Uncertainty -- Diminishable Parameterized Problems and Strict Polynomial Kernelization -- New Nonterminal Complexity Results for Semi-Conditional Grammars -- Kernelization Lower Bounds for Finding Constant-Size Subgraphs -- On General Sum Approximations of Irrational Numbers -- Computability of Ordinary Differential Equations -- Topological Analysis of Representations -- A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines -- Weak Reduction Principle and Computable Metric Spaces -- Decidable and Undecidable Fragments of First-Order Concatenation Theory -- Algorithm Analysis through Proof Complexity -- Computing with SAT Oracles: Past, Present & Future -- The Isometry Degree of a Computable Copy of ℓᵖ -- Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms -- A c.e. Weak Truth Table Degree which is Array Noncomputable and r-maximal -- The Complexity of Tukey Types and Cofinal Types -- Functionals of Type 3 as Realisers of Classical Theorems in Analysis -- Enumeration Degrees and Topology -- A Taxonomy of Deviant Encodings -- Elementary Bi-embeddability Spectra of Structures -- A Generic m-reducibility -- Some Nonstandard Equivalences in Reverse Mathematics -- Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended abstract) -- What is the Concept of Computation? -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory.
520 _aThis book constitutes the refereed proceedings of the 14th Conference on Computability in Europe, CiE 2018, held in Kiel, Germany, in July/ August 2017. The 26 revised full papers were carefully reviewed and selected from 55 submissions. In addition, this volume includes 15 invited papers. The conference CiE 2018 has six special sessions, namely: Approximation and optimization, Bioinformatics and bio-inspired computing, computing with imperfect information, continuous computation, history and philosophy of computing (celebrating the 80th birthday of Martin Davis), and SAT-solving.
541 _fUABC ;
_cTemporal ;
_d01/01/2021-12/31/2023.
650 0 _aComputer science-Mathematics.
650 0 _aNumerical analysis.
650 0 _aComputers.
650 0 _aManagement information systems.
650 0 _aComputer science.
650 1 4 _aMath Applications in Computer Science.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17044
650 2 4 _aNumeric Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
650 2 4 _aTheory of Computation.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16005
650 2 4 _aManagement of Computing and Information Systems.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I24067
700 1 _aManea, Florin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMiller, Russell G.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNowotka, Dirk.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319944173
776 0 8 _iPrinted edition:
_z9783319944197
830 0 _aTheoretical Computer Science and General Issues ;
_v10936
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=https://doi.org/10.1007/978-3-319-94418-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c242056
_d242055