Sailing Routes in the World of Computation 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Manea, Florin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Miller, Russell G. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Nowotka, Dirk (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Theoretical Computer Science and General Issues ; 10936
• Θέματα: Computer science-Mathematics.; Numerical analysis.; Computers.; Management information systems.; Computer science.; Math Applications in Computer Science.; Numeric Computing.; Theory of Computation.; Management of Computing and Information Systems.

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

Πίνακας περιεχομένων:

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