Language, Life, Limits
Springer International Publishing (Verlag)
978-3-319-08018-5 (ISBN)
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.
| Erscheint lt. Verlag | 4.8.2014 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIV, 410 p. 33 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 646 g |
| Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Automata Theory • bio-inspired computation • Biological Computing • Computability Theory • Computational Complexity • Computational Linguistics • History of Computing • Natural Computing • online algorithms • Theory of Computation |
| ISBN-10 | 3-319-08018-0 / 3319080180 |
| ISBN-13 | 978-3-319-08018-5 / 9783319080185 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
