The Nature Of Computation: Logic, Algorithms, Applications: 9th Conference On Computability In Europe, Cie 2013, Milan, Italy, by Paola BonizzoniThe Nature Of Computation: Logic, Algorithms, Applications: 9th Conference On Computability In Europe, Cie 2013, Milan, Italy, by Paola Bonizzoni

The Nature Of Computation: Logic, Algorithms, Applications: 9th Conference On Computability In…

byPaola BonizzoniEditorVasco Brattka, Benedikt Löwe

Paperback | July 19, 2013

Pricing and Purchase Info

$97.24 online 
$103.50 list price save 6%
Earn 486 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013.
The 48 revised papers presented together with 1 invited lecture and 2
tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.

Title:The Nature Of Computation: Logic, Algorithms, Applications: 9th Conference On Computability In…Format:PaperbackDimensions:446 pages, 23.5 × 15.5 × 0.02 inPublished:July 19, 2013Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642390528

ISBN - 13:9783642390524

Look for similar items by category:

Reviews

Table of Contents

Real Benefit of Promises and Advice.- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.- An Overview of Genomic Distances Modeled with Indels.- Noise versus Computational Intractability in Dynamics.- Cluster Editing.- Beyond Rogers' Non-constructively Computable Function.- Constructing Continuous Systems from Discrete Cellular Automata.- Latency-Bounded Target Set Selection in Social Networks.- Summary Data Structures for Massive Data.- Determinant versus Permanent: Salvation via Generalization.- Aligning and Labeling Genomes under the Duplication-Loss Model.- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds.- Processes Inspired by the Functioning of Living Cells: Natural Computing Approach.- Recent Developments in Collective Decision Making in Combinatorial Domains.- Software Streams: Big Data Challenges in Dynamic Program Analysis.- Onλ-Definable Functions on Ordinals.- A Personal View of the P versus NP Problem.- An Investigation on Genomic Repeats.- Local Computability for Ordinals.- A Note on the Sequential Version of Î 12 Statements.- On Conservative Learning of Recursively Enumerable Languages.- Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations.- On Decidable and Computable Models of Theories.- Discovering Hidden Repetitions in Words.- Language Forbidding-Enforcing Systems Defining DNA Codewords.- ComputingK-Trivial Sets by Incomplete Random Sets.- Cardinal-Recognizing Infinite Time Turing Machines.- 'Stored Program Concept' Considered Harmful: History and Historiography.- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.- The Computation of Nature, Or: Does the Computer Drive Science and Technology.- Negative Glues and Non-determinism in Nanocomputations by Self-assembly.- Structures without Scattered-Automatic Presentation.- Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems.- Closed Choice for Finite and for Convex Sets.- Realizability Models Separating Various Fan Theorems.- Towards a Theory of Homomorphic Compression.- The Classification Problem for Compact Computable Metric Spaces.- Exploiting Co-evolution across Protein Families for Predicting Native Contacts and Protein-Protein Interaction Surfaces.- A Compositional Semantics of Reaction Systems with Restriction.- Using Random Graphs in Population Genomics.- The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models.- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words.- A Note onÏ-Jump Inversion of Degree Spectra of Structures.- The Turing Universe in the Context of Enumeration Reducibility.- Computing Game Strategies.- On Processes and Structures.- Various Regularity Lemmas in Graphs and Hypergraphs.- Three Debates about Computing.- Another Jump Inversion Theorem for Structures.- On Algorithmic Strong Sufficient Statistics.- Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.