LEADER 03806nam  22006255  450 
001 996199994603316
005 20230223045134.0
010   $a3-319-08019-9
024 7 $a10.1007/978-3-319-08019-2
035   $a(CKB)3710000000143873
035   $a(SSID)ssj0001276363
035   $a(PQKBManifestationID)11762171
035   $a(PQKBTitleCode)TC0001276363
035   $a(PQKBWorkID)11239457
035   $a(PQKB)10112464
035   $a(DE-He213)978-3-319-08019-2
035   $a(MiAaPQ)EBC3093614
035   $a(PPN)179766406
035   $a(EXLCZ)993710000000143873
100   $a20140605d2014      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aLanguage, Life, Limits$b[electronic resource] $e10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings /$fedited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (XIV, 410 p. 33 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8493
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-08018-0 
327   $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.
330   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8493
606   $aComputer science
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aTheory of Computation
606   $aAlgorithms
606   $aMathematics of Computing
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615 14$aTheory of Computation.
615 24$aAlgorithms.
615 24$aMathematics of Computing.
676   $a004.0151
702   $aBeckmann$b Arnold$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aCsuhaj-Varjú$b Ersébet$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMeer$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996199994603316
996   $aLanguage, Life, Limits$92831535
997   $aUNISA