04470nam 2200577 a 450 991048463970332120200520144314.01-280-38752-197866135654403-642-13962-010.1007/978-3-642-13962-8(CKB)2670000000028971(SSID)ssj0000446718(PQKBManifestationID)11310112(PQKBTitleCode)TC0000446718(PQKBWorkID)10496847(PQKB)10759593(DE-He213)978-3-642-13962-8(MiAaPQ)EBC3065480(PPN)149064195(EXLCZ)99267000000002897120100520d2010 uy 0engurnn|008mamaatxtccrPrograms, proofs, processes 6th conference on computability in Europe, CIE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings /Fernando Ferreira ... [et al.] (Eds.)1st ed.Berlin Springer20101 online resource (XIV, 450 p. 37 illus.) LNCS sublibrary. SL 1, Theoretical computer science and general issuesLecture notes in computer science,0302-9743 ;6158Bibliographic Level Mode of Issuance: Monograph3-642-13961-2 Includes bibliographical references and index.Avoiding 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.Lecture notes in computer science.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Computable functionsCongressesComputable functions004.0151Ferreira Fernando1627552Conference on Computability in EuropeMiAaPQMiAaPQMiAaPQBOOK9910484639703321Programs, proofs, processes4195669UNINA