Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1223
Full metadata record
DC FieldValueLanguage
dc.contributor.authorManea, Florin. ;en_US
dc.contributor.authorMiller, Russell G. ;en_US
dc.contributor.authorNowotka, Dirk. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:39Z-
dc.date.available2020-05-17T08:26:39Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319944180 ;en_US
dc.identifier.isbn9783319944173 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1223-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319944173. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityedited by Florin Manea, Russell G. Miller, Dirk Nowotka.en_US
dc.description.tableofcontentsA 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 eeee -- 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 Computatione -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory. ;en_US
dc.format.extentXV, 434 p. 28 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.haspart9783319944173.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputersen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectManagement Information Systemsen_US
dc.subjectComputer Scienceen_US
dc.subjectMath Applications in Computer Science. ;en_US
dc.subjectNumeric Computing. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.subjectManagement of Computing and Information Systems. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleSailing Routes in the World of Computationen_US
dc.title.alternative14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 ee August 3, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319944173.pdf10.21 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorManea, Florin. ;en_US
dc.contributor.authorMiller, Russell G. ;en_US
dc.contributor.authorNowotka, Dirk. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:39Z-
dc.date.available2020-05-17T08:26:39Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319944180 ;en_US
dc.identifier.isbn9783319944173 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1223-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319944173. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityedited by Florin Manea, Russell G. Miller, Dirk Nowotka.en_US
dc.description.tableofcontentsA 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 eeee -- 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 Computatione -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory. ;en_US
dc.format.extentXV, 434 p. 28 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.haspart9783319944173.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputersen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectManagement Information Systemsen_US
dc.subjectComputer Scienceen_US
dc.subjectMath Applications in Computer Science. ;en_US
dc.subjectNumeric Computing. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.subjectManagement of Computing and Information Systems. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleSailing Routes in the World of Computationen_US
dc.title.alternative14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 ee August 3, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319944173.pdf10.21 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorManea, Florin. ;en_US
dc.contributor.authorMiller, Russell G. ;en_US
dc.contributor.authorNowotka, Dirk. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:39Z-
dc.date.available2020-05-17T08:26:39Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319944180 ;en_US
dc.identifier.isbn9783319944173 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1223-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319944173. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityedited by Florin Manea, Russell G. Miller, Dirk Nowotka.en_US
dc.description.tableofcontentsA 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 eeee -- 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 Computatione -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory. ;en_US
dc.format.extentXV, 434 p. 28 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10936. ;en_US
dc.relation.haspart9783319944173.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputersen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectManagement Information Systemsen_US
dc.subjectComputer Scienceen_US
dc.subjectMath Applications in Computer Science. ;en_US
dc.subjectNumeric Computing. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.subjectManagement of Computing and Information Systems. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleSailing Routes in the World of Computationen_US
dc.title.alternative14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 ee August 3, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319944173.pdf10.21 MBAdobe PDFThumbnail
Preview File