Language, life, limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings /

This 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 proceedin...

Full description

Bibliographic Details
Corporate Author: Conference on Computability in Europe Budapest, Hungary
Other Authors: Beckmann, Arnold (Editor), Csuhaj-Varjú, E. (Editor), Csuhaj-Varjú, E. (Editor), Meer, Klaus (Editor)
Format: Conference Proceeding Book
Language:English
Published: Cham : Springer, 2014
Series:LNCS sublibrary Theoretical computer science and general issues.
Lecture notes in computer science ; 8493
Subjects:
LEADER 06886nam a2200889Ii 4500
001 d70633ff-0296-4ce0-a572-4310801cc977
005 20240811000000.0
008 140617s2014 sz a o 101 0 eng d
020 |a 3319080180  |q (print) 
020 |a 3319080199  |q (electronic bk.) 
020 |a 9783319080185  |q (print) 
020 |a 9783319080192  |q (electronic bk.) 
020 |z 9783319080185 
024 7 |a 10.1007/978-3-319-08019-2  |2 doi 
035 |a (OCoLC)881453163 
040 |a GW5XE  |b eng  |e rda  |e pn  |c GW5XE  |d COO  |d YDXCP  |d OCLCF  |d UPM  |d OCL  |d OCLCO  |d EBLCP   |d OCLCQ  |d OCLCO  |d DIBIB  |d OCLCO  |d JG0  |d ESU  |d OCLCQ  |d IOG  |d NJR  |d MERUC  |d BUF  |d VMW  |d COS   |d COF  |d CEF  |d DEHBZ  |d CRU  |d OCLCQ  |d TFW  |d U3W  |d AU@  |d OCLCQ  |d WYU  |d YOU  |d OCLCQ  |d WURST   |d AJS  |d UKAHL  |d CSt 
040 |a GW5XE  |b eng  |e rda  |e pn  |c GW5XE  |d COO  |d YDXCP  |d OCLCF  |d UPM  |d OCL  |d OCLCO  |d EBLCP  |d OCLCQ  |d OCLCO  |d DIBIB  |d OCLCO  |d JG0 
049 |a MAIN 
050 4 |a QA9.59 
066 |c (S 
072 7 |a COM037000  |2 bisacsh 
072 7 |a UYZG  |2 bicssc 
082 0 4 |a 511.3/52  |2 23 
111 2 |a Conference on Computability in Europe  |n (10th :  |d 2014 :  |c Budapest, Hungary)  |1 http://viaf.org/viaf/310717856 
111 2 |a Conference on Computability in Europe  |n (10th :  |d 2014 :  |c Budapest, Hungary) 
245 1 0 |a Language, life, limits :  |b 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings /  |c Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer (eds.) 
246 3 |a CiE 2014 
264 1 |a Cham :  |b Springer,  |c 2014 
300 |a 1 online resource (xiv, 410 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a LNCS sublibrary. SL 1, Theoretical computer science and general issues 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 8493 
500 |a Includes author index 
500 |a International conference proceedings 
505 0 |a 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 [eta]-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 |a This 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 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed June 17, 2014) 
596 |a 22 
650 0 |a Computable functions  |v Congresses 
650 0 |a Computer science  |x Mathematics  |v Congresses 
650 4 |a Computer Science 
650 4 |a Engineering & Applied Sciences 
650 7 |a Computable functions  |2 fast 
650 7 |a Computer science  |x Mathematics  |2 fast 
650 2 4 |a Algorithm Analysis and Problem Complexity 
650 2 4 |a Computation by Abstract Devices 
650 2 4 |a Mathematics of Computing 
653 0 0 |a algorithms 
653 0 0 |a algoritmen 
653 0 0 |a computational mathematics 
653 0 0 |a computational science 
653 0 0 |a computer analysis 
653 0 0 |a computer sciences 
653 0 0 |a computeranalyse 
653 0 0 |a computerwetenschappen 
653 0 0 |a computerwiskunde 
653 1 0 |a Informatie- en communicatietechnologie (algemeen) 
653 1 0 |a Information and Communication Technology (General) 
655 4 |a Electronic books 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Ebook  |2 local 
700 1 |a Beckmann, Arnold,  |e editor  |1 http://viaf.org/viaf/62274720 
700 1 |a Beckmann, Arnold,  |e editor 
700 1 |a Csuhaj-Varjú, E.,  |e editor  |1 http://viaf.org/viaf/75421404 
700 1 |a Csuhaj-Varjú, E.,  |e editor 
700 1 |a Meer, Klaus,  |e editor  |1 http://viaf.org/viaf/37996832 
700 1 |a Meer, Klaus,  |e editor 
776 0 8 |i Printed edition:  |z 9783319080185 
830 0 |a LNCS sublibrary  |n SL 1,  |p Theoretical computer science and general issues. 
830 0 |a Lecture notes in computer science ;  |v 8493  |x 0302-9743 
880 0 |6 505-00/(S  |a 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 
999 1 0 |i d70633ff-0296-4ce0-a572-4310801cc977  |l a10577506  |s US-CST  |m language_life_limits10th_conference_on_computability_in_europe_cie_201_____2014_______sprina________________________________________conference_on_comput_______________e 
999 1 0 |i d70633ff-0296-4ce0-a572-4310801cc977  |l 11085719  |s US-ICU  |m language_life_limits10th_conference_on_computability_in_europe_cie_201_____2014_______sprina________________________________________conference_on_comput_______________e 
999 1 1 |l a10577506  |s ISIL:US-CST  |t BKS  |a SUL INTERNET  |b 10577506-1001  |c INTERNET RESOURCE  |d ASIS  |x SUL  |y 10577506-1001  |p UNLOANABLE