| 000 | 03593nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | vtls000543636 | ||
| 003 | RU-ToGU | ||
| 005 | 20210922082552.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160915s2014 gw | s |||| 0|eng d | ||
| 020 |
_a9783319080192 _9978-3-319-08019-2 |
||
| 024 | 7 |
_a10.1007/978-3-319-08019-2 _2doi |
|
| 035 | _ato000543636 | ||
| 040 |
_aSpringer _cSpringer _dRU-ToGU |
||
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYZG _2bicssc |
|
| 072 | 7 |
_aCOM037000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aLanguage, Life, Limits _helectronic resource _b10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings / _cedited by Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer. |
| 260 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
||
| 300 |
_aXIV, 410 p. 33 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8493 |
|
| 505 | 0 | _aHow 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. | |
| 520 | _aThis 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. | ||
| 650 | 0 |
_aComputer Science. _9155490 |
|
| 650 | 0 |
_aComputer software. _9303280 |
|
| 650 | 1 | 4 |
_aComputer Science. _9155490 |
| 650 | 2 | 4 |
_aComputation by Abstract Devices. _9305111 |
| 650 | 2 | 4 |
_aAlgorithm Analysis and Problem Complexity. _9303732 |
| 650 | 2 | 4 |
_aMathematics of Computing. _9303612 |
| 700 | 1 |
_aBeckmann, Arnold. _eeditor. _9324389 |
|
| 700 | 1 |
_aCsuhaj-Varjú, Erzsébet. _eeditor. _9328916 |
|
| 700 | 1 |
_aMeer, Klaus. _eeditor. _9449526 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9143950 |
|
| 773 | 0 | _tSpringer eBooks | |
| 830 | 0 |
_aLecture Notes in Computer Science, _9279505 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-08019-2 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 | _c400782 | ||