Sailing routes in the world of computation : 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30-August 3, 2018, Proceedings /: 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30-August 3, 2018, Proceedings. (2018)

• Record Type: Book
• Other Titles: CiE 2018
• Further Information: Note: Florin Manea, Russell G. Miller, Dirk Nowotka (eds.).
• Editors: Manea, Florin; Miller, Russell G; Nowotka, Dirk
• Other Names: Conference on Computability in Europe, 14th
• Contents: A 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2018
• Extent: 1 online resource (xv, 434 pages), illustrations
• Subjects: 511.3/52; Computer science; Computable functions -- Congresses; Computer science -- Mathematics -- Congresses; Computable functions; Computer science -- Mathematics; Computer Science; Math Applications in Computer Science; Numeric Computing; Theory of Computation; Management of Computing and Information Systems; Computers -- Programming -- Algorithms; Computers -- Computer Science; Business & Economics -- Information Management; Mathematical theory of computation; Computer science; Information architecture; Electronic data processing; Information theory; Information Systems; Computers -- Data Processing; Maths for computer scientists; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319944180; 3319944185
• Related ISBNs: 9783319944173
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed July 26, 2018).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.