Full Description
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.
Contents
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 AbelianGroups 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.
