LEADER 05539nam 22007815 450 001 996198520003316 005 20230329173159.0 010 $a3-319-20028-3 024 7 $a10.1007/978-3-319-20028-6 035 $a(CKB)3710000000436894 035 $a(SSID)ssj0001558510 035 $a(PQKBManifestationID)16183807 035 $a(PQKBTitleCode)TC0001558510 035 $a(PQKBWorkID)14819473 035 $a(PQKB)10248033 035 $a(DE-He213)978-3-319-20028-6 035 $a(MiAaPQ)EBC5587785 035 $a(Au-PeEL)EBL5587785 035 $a(OCoLC)911621687 035 $a(PPN)186399529 035 $a(EXLCZ)993710000000436894 100 $a20150619d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aEvolving Computability$b[electronic resource] $e11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings /$fedited by Arnold Beckmann, Victor Mitrana, Mariya Soskova 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XV, 363 p. 20 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9136 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-20027-5 327 $aComputers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt -- Error and predicativity -- Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems -- A New Approach to the Paperfolding Sequences -- Covering the Recursive Sets -- On Distributed Monitoring and Synthesis -- Newton's Forward Difference Equation for Functions from Words to Words -- Degrees of unsolvability: a tutorial -- Universality in Molecular and Cellular Computing -- Some results on interactive proofs for real computations -- Prime Model with No Degree of Autostability Relative to Strong Constructivizations -- Immune Systems in Computer Virology -- ITRM-Recognizability from Random Oracles -- Systems with Parallel Rewriting for Chain Code Picture Languages -- Base-Complexity Classifications of QCB0-Spaces (Extended Abstract) -- Maximal Vector Spaces form an Automorphism Basis -- New Bounds on Optimal Sorting Networks -- Nonexistence of Minimal Pairs in L[d] -- Intuitionistic Provability versus Uniform Provability in RCA -- Randomness and Differentiability of Convex Functions -- Weighted automata on infinite words in the context of Attacker-Defender games -- Turing jumps through provability -- Rice's Theorem in Effectively Enumerable Topological Spaces -- Decidability of Termination Problems for Sequential P Systems with Active Membranes -- Weihrauch degrees of finding equilibria in sequential games -- Prefix and Right-Partial Derivative Automata -- A Note on the Computable Categoricity of l^p Spaces -- n the Computational Content of Termination Proofs -- Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete -- Iterative forcing and hyperimmunity in reverse mathematics -- Completely regular Bishop spaces -- Computing Equality-Free String Factorisations -- Towards the Effective Descriptive Set Theory -- On Computability of Navier-Stokes' Equation -- Undecidability as a Consequence of Incompleteness -- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems. 330 $aThis book constitutes the refereed proceedings of the 11th Conference on Computability in Europe, CiE 2015, held in Bucharest, Romania, in June/July 2015. The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings. The conference CiE 2015 has six special sessions: two sessions, Representing Streams and Reverse Mathematics, were introduced for the first time in the conference series. In addition to this, new developments in areas frequently covered in the CiE conference series were addressed in the further special sessions on Automata, Logic and Infinite Games; Bio-inspired Computation; Classical Computability Theory; as well as History and Philosophy of Computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9136 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aMachine theory 606 $aBioinformatics 606 $aTheory of Computation 606 $aAlgorithms 606 $aMathematics of Computing 606 $aFormal Languages and Automata Theory 606 $aComputational and Systems Biology 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aMachine theory. 615 0$aBioinformatics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aFormal Languages and Automata Theory. 615 24$aComputational and Systems Biology. 676 $a004.0151 702 $aBeckmann$b Arnold$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMitrana$b Victor$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSoskova$b Mariya$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198520003316 996 $aEvolving Computability$92830167 997 $aUNISA