Cantitate/Preț
Produs
Total produse
Vezi coșul
Language, Life, Limits de Arnold Beckmann

Language, Life, Limits

Editat de Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer
en Limba Engleză Paperback – 4 aug 2014
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.
Citește tot Restrânge

Preț: 32749 lei

Preț vechi: 40937 lei
-20% Nou

Puncte Express: 491
Preț estimativ în valută:
5795€ • 6795$ • 5089£

Carte tipărită la comandă

Livrare economică 05-19 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319080185
ISBN-10: 3319080180
Pagini: 424
Ilustrații: XIV, 410 p. 33 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.64 kg
Ediția:2014
Editura: Springer
Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.