Language, Life, Limits : 10th Conference on Computability in Europe, Cie 2014, Budapest, Hungary, June 23-27, 2014, Proceedings
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783319080185
- ISBN-10: 3319080180
- Publisher: Springer
- Publish Date: August 2014
- Dimensions: 9.21 x 6.14 x 0.87 inches
- Shipping Weight: 1.31 pounds
- Page Count: 410
Related Categories
