000 05678nam a22006255i 4500
001 978-3-319-20028-6
003 DE-He213
005 20210120143343.0
007 cr nn 008mamaa
008 150619s2015 gw | s |||| 0|eng d
020 _a9783319200286
_9978-3-319-20028-6
024 7 _a10.1007/978-3-319-20028-6
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM037000
_2bisacsh
072 7 _aUY
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aEvolving Computability
_h[electronic resource] :
_b11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings /
_cedited by Arnold Beckmann, Victor Mitrana, Mariya Soskova.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXV, 363 p. 20 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v9136
_aLecture Notes in Computer Science
_v9136
505 0 _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.
520 _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.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer science—Mathematics.
650 0 _aMathematical logic.
650 0 _aBioinformatics.
650 1 4 _aComputation by Abstract Devices.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16013
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 2 4 _aMathematics of Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17001
650 2 4 _aMathematical Logic and Formal Languages.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16048
650 2 4 _aComputational Biology/Bioinformatics.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I23050
700 1 _aBeckmann, Arnold.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMitrana, Victor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSoskova, Mariya.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319200293
776 0 8 _iPrinted edition:
_z9783319200279
830 0 _aTheoretical Computer Science and General Issues ;
_v9136
830 0 _aLecture Notes in Computer Science ;
_v9136
856 4 0 _uhttps://doi.org/10.1007/978-3-319-20028-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57741
_d57741