Fernando Ferreira

Programs, Proofs, Processes: 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings - Theoretical Computer Science and General Issues Fernando Ferreira 2010 edition

Marc Notes: Includes bibliographical references and index. Table of Contents: Avoiding Simplicity Is Complex / Eric Allender -- Higher-Order Containers / Thorsten Altenkirch, Paul Levy, Sam Staton -- On the Completeness of Quantum Computation Models / Pablo Arrighi, Gilles Dowek -- The Ordinal of Skolem + Tetration Is ?0 / Mathias Barra, Philipp Gerhardy -- Proofs, Programs, Processes / Ulrich Berger, Monika Seisenberger -- Ergodic-Type Characterizations of Algorithmic Randomness / Laurent Bienvenu, Adam Day, Ilya Mezhirov, Alexander Shen -- How Powerful Are Integer-Valued Martingales? / Laurent Bienvenu, Frank Stephan, Jason Teutsch -- A Faster Algorithm for Finding Minimum Tucker Submatrices / Guillaume Blin, Romeo Rizzi, StEphane Vialette -- Processes in Space / Luca Cardelli, Philippa Gardner -- Computability of Countable Subshifts / Douglas Cenzer, Ali Dashti, Ferit Toska, Sebastian Wyman -- The Limits of Tractability in Resolution-Based Propositional Proof Systems / Stefan Dantchev, Barnaby Martin -- Haskell before Haskell: Curry's Contribution to Programming (1946-1950) / Liesbeth De Mol, Maarten Bullynck, Martin CarlE -- A Miniaturisation of Ramsey's Theorem / Michiel De Smet, Andreas Weiermann -- Graph Structures and Algorithms for Query-Log Analysis / Debora Donato -- On the Complexity of Local Search for Weighted Standard Set Problems / Dominic Dumrauf, Tim SU? -- Computational Interpretations of Analysis via Products of Selection Functions / MartIn EscardO, Paulo Oliva -- The Peirce Translation and the Double Negation Shift / MartIn EscardO, Paulo Oliva -- Counting the Changes of Random ?02 Sets / Santiago Figueira, Denis Hirschfeldt, Joseph S. Miller, Keng Meng Ng, AndrE Nies -- Boole: From Calculating Numbers to Calculating Thoughts / MichEle Friend -- Approximability and Hardness in Multi-objective Optimization / Christian Gla?er, Christian Reitwie?ner, Heinz Schmitz, Maximilian Witek -- Pw Is Not a Heyting Algebra / Kojiro Higuchi -- Lower Bounds for Reducibility to the Kolmogorov Random Strings / John M. Hitchcock -- Spatial Models for Virtual Networks / Jeannette Janssen -- DNA Rearrangements through Spatial Graphs / NataSa Jonoska, Masahico Saito -- On Index Sets of Some Properties of Computable Algebras / Bakhadyr Khoussainov, Andrey Morozov -- The Strength of the Besicovitch-Davies Theorem / BjOrn Kjos-Hanssen, Jan Reimann -- Circuit Complexity and Multiplicative Complexity of Boolean Functions / Arist Kojevnikov, Alexander S. Kulikov -- Definability in the Subword Order / Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva -- Undecidability in Weihrauch Degrees / Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov -- Degrees with Almost Universal Cupping Property / Jiang Liu, Guohua Wu -- Incomputability in Physics / Giuseppe Longo -- Approximate Self-assembly of the Sierpinski Triangle / Jack H. Lutz, Brad Shutters -- Hairpin Lenthening / Florin Manea, Carlos MartIn-Vide, Victor Mitrana -- Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program / Yuri I. Manin -- Computational Complexity Aspects in Membrane Computing / Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron -- Computable Ordered Abelian Groups and Fields / Alexander G. Melnikov -- Focusing in Asynchronous Games / Samuel Mimram -- A Note on the Least Informative Model of a Theory / Jeff B. Paris, Soroush R. Rad -- Three Roots for Leibniz's Contribution to the Computational Conception of Reason / Olga Pombo -- Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo / Yasubumi Sakakibara -- The Complexity of Explicit Constructions / Rahul Santhanam -- Kolmogorov Complexity Cores / AndrE Souto -- Every ?02-Set Is Natural, Up to Turing Equivalence / Dieter Spreen -- Computable Fields and Weak Truth-Table Reducibility / Rebecca M. Steiner -- What Is the Problem with Proof Nets for Classical Logic? / Lutz Stra?burger -- Quasi-linear Dialectica Extraction / Trifon Trifonov -- Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole / Sara L. Uckelman -- Inference Concerning Physical Systems / David H. Wolpert -- Author Index. Publisher Marketing: CiE 2010: Programs, Proofs, Processes Ponta Delgada, Azores, Portugal, June 30 July 4 2010 The last few years, starting in 2005 with out inaugural conference in Amst- dam, have seen a development from an informal cooperation via an increasingly established conference series to an association, founded in 2008. While the or- nization formofComputability in Europe (CiE) may havechanged, the scienti?c scope is still the same and as interdisciplinary and innovative as it was six year ago when we held the ?rst conference. CiE aims to promote computabili- related science in its broadest sense, including mathematics, computer science, applications in various natural and engineering sciences (e. g., physics, biology, computer engineering), and also reaches out to meta-studies such as the history and philosophy of computing. Researchers at CiE conferences wish to advance our theoretical understanding of what can and cannot be computed, by any means of computation. CiE 2010 was the sixth conference of the series, held in a geographically unique anddramatic location, Europe s mostwesterlyoutpost, atthe University ofAzoresinPontaDelgada, Portugal. ThethemeofCiE2010 Programs, Proofs, Processes points to the usual CiE synergy of computer science, mathematics and logic, with important computability-theoretic connections to science and the real universe. Formal systems, attendant proofs, and the possibility of their computer generation and manipulation (for instance, into programs) have been changing a whole spectrum of disciplines."

Contributor Bio:  Lowe, Benedikt Benedikt Lowe is Universitair Docent in Logic in the Institute for Logic, Language and Computation at the Universiteit van Amsterdam and Professor of Mathematics at the Universitat Hamburg. He is the vice-president of the Deutsche Vereinigung fur Mathematische Logik und fur Grundlagenforschung der Exakten Wissenschaften (DVMLG) and a Managing Editor of the journal Mathematical Logic Quarterly. Contributor Bio:  L We, Benedikt Benedikt L we is Universitair Docent in Logic in the Institute for Logic, Language and Computation at the Universiteit van Amsterdam and Professor of Mathematics at the Universit t Hamburg. He is the vice-president of the Deutsche Vereinigung f r Mathematische Logik und f r Grundlagenforschung der Exakten Wissenschaften (DVMLG) and a Managing Editor of the journal Mathematical Logic Quarterly.