Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer.

Format:

Book

Contributor:

Beckmann, Arnold, editor.

Csuhaj-Varjú, Ersébet, editor.

Meer, Klaus, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8493.

Theoretical Computer Science and General Issues ; 8493

Language:

English

Subjects (All):

Computers.

Algorithms.

Computer science--Mathematics.

Computer science.

Computation by Abstract Devices.

Algorithm Analysis and Problem Complexity.

Mathematics of Computing.

Local Subjects:

Computation by Abstract Devices.

Algorithm Analysis and Problem Complexity.

Mathematics of Computing.

Physical Description:

1 online resource (XIV, 410 pages) : 33 illustrations.

Edition:

First edition 2014.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2014.

System Details:

text file PDF

Summary:

This book constitutes the refereed proceedings of the 10th Conference on Computability in Europe, CiE 2014, held in Budapest, Hungary, in June 2014. The 42 revised papers presented were carefully reviewed and selected from 78 submissions and included together with 15 invited papers in this proceedings. The conference had six special sessions: computational linguistics, bio-inspired computation, history and philosophy of computing, computability theory, online algorithms, and complexity in automata theory.

Contents:

How can Grammatical Inference Contribute to Computational Linguistics?

Algorithms and Their Explanations

Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability

Uniform Schemata for Proof Rules

Graph Polynomials Motivated by Gene Rearrangements in Ciliates

On the Equivalence of Automata for KAT-expressions

Algorithmic Randomness for Infinite Time Register Machines

Constraint Logic Programming for Resolution of Relative Time Expressions

Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries

Learnability Thesis Does Not Entail Church's Thesis

Phase Transitions Related to the Pigeonhole Principle

Generic Parallel Algorithms

Fit-Preserving Data Refinement of Mass-Action Reaction Networks

On Maximal Block Functions of Computable η-like Linear Orderings

Lossiness of Communication Channels Modeled by Transducers

Predicate Characterizations in the Polynomial-Size Hierarchy

Function Spaces for Second-Order Polynomial Time

Complexity of Operation Problems.

Other Format:

Printed edition:

ISBN:

978-3-319-08019-2

9783319080192

Access Restriction:

Restricted for use by site license.