Buch, Englisch, Band 8493, 410 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 639 g
10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings
Buch, Englisch, Band 8493, 410 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 639 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-319-08018-5
Verlag: Springer International Publishing
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Geisteswissenschaften Sprachwissenschaft Computerlinguistik, Korpuslinguistik
Weitere Infos & Material
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.
