000 03492nam a22005295i 4500
001 978-3-319-08019-2
003 DE-He213
005 20200421112233.0
007 cr nn 008mamaa
008 140605s2014 gw | s |||| 0|eng d
020 _a9783319080192
_9978-3-319-08019-2
024 7 _a10.1007/978-3-319-08019-2
_2doi
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
_h[electronic resource] :
_b10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings /
_cedited by Arnold Beckmann, Erzs�ebet Csuhaj-Varj�u, Klaus Meer.
264 1 _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
347 _atext file
_bPDF
_2rda
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 (Sj(B-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.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematics of Computing.
700 1 _aBeckmann, Arnold.
_eeditor.
700 1 _aCsuhaj-Varj�u, Erzs�ebet.
_eeditor.
700 1 _aMeer, Klaus.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319080185
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8493
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-08019-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58104
_d58104