LEADER 04470nam 2200577 a 450 001 9910484639703321 005 20200520144314.0 010 $a1-280-38752-1 010 $a9786613565440 010 $a3-642-13962-0 024 7 $a10.1007/978-3-642-13962-8 035 $a(CKB)2670000000028971 035 $a(SSID)ssj0000446718 035 $a(PQKBManifestationID)11310112 035 $a(PQKBTitleCode)TC0000446718 035 $a(PQKBWorkID)10496847 035 $a(PQKB)10759593 035 $a(DE-He213)978-3-642-13962-8 035 $a(MiAaPQ)EBC3065480 035 $a(PPN)149064195 035 $a(EXLCZ)992670000000028971 100 $a20100520d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aPrograms, proofs, processes $e6th conference on computability in Europe, CIE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings /$fFernando Ferreira ... [et al.] (Eds.) 205 $a1st ed. 210 $aBerlin $cSpringer$d2010 215 $a1 online resource (XIV, 450 p. 37 illus.) 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6158 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13961-2 320 $aIncludes bibliographical references and index. 327 $aAvoiding Simplicity Is Complex -- Higher-Order Containers -- On the Completeness of Quantum Computation Models -- The Ordinal of Skolem + Tetration Is ? 0 -- Proofs, Programs, Processes -- Ergodic-Type Characterizations of Algorithmic Randomness -- How Powerful Are Integer-Valued Martingales? -- A Faster Algorithm for Finding Minimum Tucker Submatrices -- Processes in Space -- Computability of Countable Subshifts -- The Limits of Tractability in Resolution-Based Propositional Proof Systems -- Haskell before Haskell: Curry?s Contribution to Programming (1946?1950) -- A Miniaturisation of Ramsey?s Theorem -- Graph Structures and Algorithms for Query-Log Analysis -- On the Complexity of Local Search for Weighted Standard Set Problems -- Computational Interpretations of Analysis via Products of Selection Functions -- The Peirce Translation and the Double Negation Shift -- Counting the Changes of Random Sets -- Boole: From Calculating Numbers to Calculating Thoughts -- Approximability and Hardness in Multi-objective Optimization -- Is Not a Heyting Algebra -- Lower Bounds for Reducibility to the Kolmogorov Random Strings -- Spatial Models for Virtual Networks -- DNA Rearrangements through Spatial Graphs -- On Index Sets of Some Properties of Computable Algebras -- The Strength of the Besicovitch-Davies Theorem -- Circuit Complexity and Multiplicative Complexity of Boolean Functions -- Definability in the Subword Order -- Undecidability in Weihrauch Degrees -- Degrees with Almost Universal Cupping Property -- Incomputability in Physics -- Approximate Self-assembly of the Sierpinski Triangle -- Hairpin Lengthening -- Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program -- Computational Complexity Aspects in Membrane Computing -- Computable Ordered Abelian Groups and Fields -- Focusing in Asynchronous Games -- A Note on the Least Informative Model of a Theory -- Three Roots for Leibniz?s Contribution to the Computational Conception of Reason -- Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo -- The Complexity of Explicit Constructions -- Kolmogorov Complexity Cores -- Every -Set Is Natural, Up to Turing Equivalence -- Computable Fields and Weak Truth-Table Reducibility -- What Is the Problem with Proof Nets for Classical Logic? -- Quasi-linear Dialectica Extraction -- Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole -- Inference Concerning Physical Systems. 410 0$aLecture notes in computer science. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aComputable functions$vCongresses 615 0$aComputable functions 676 $a004.0151 701 $aFerreira$b Fernando$01627552 712 12$aConference on Computability in Europe 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484639703321 996 $aPrograms, proofs, processes$94195669 997 $aUNINA