Language, Life, Limits

10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings

Häftad, Engelska, 2014

Av Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer

739 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2014-08-04
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor410
FörlagSpringer International Publishing AG
ISBN9783319080185

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it

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.