6. CiE 2010: Ponta Deldaga, Azores, Portugal

• Eric Allender:
  Avoiding Simplicity Is Complex. 1-10
  
• Thorsten Altenkirch, Paul Levy, Sam Staton:
  Higher-Order Containers. 11-20
  
• Pablo Arrighi, Gilles Dowek:
  On the Completeness of Quantum Computation Models. 21-30
  
• Mathias Barra, Philipp Gerhardy:
  The Ordinal of Skolem + Tetration Is tau₀. 31-38
  
• Ulrich Berger, Monika Seisenberger:
  Proofs, Programs, Processes. 39-48
  
• Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen:
  Ergodic-Type Characterizations of Algorithmic Randomness. 49-58
  
• Laurent Bienvenu, Frank Stephan, Jason Teutsch:
  How Powerful Are Integer-Valued Martingales? 59-68
  
• Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
  A Faster Algorithm for Finding Minimum Tucker Submatrices. 69-77
  
• Luca Cardelli, Philippa Gardner:
  Processes in Space. 78-87
  
• Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman:
  Computability of Countable Subshifts. 88-97
  
• Stefan S. Dantchev, Barnaby Martin:
  The Limits of Tractability in Resolution-Based Propositional Proof Systems. 98-107
  
• Liesbeth De Mol, Maarten Bullynck, Martin Carlé:
  Haskell before Haskell: Curry's Contribution to Programming (1946-1950). 108-117
  
• Michiel De Smet, Andreas Weiermann:
  A Miniaturisation of Ramsey's Theorem. 118-125
  
• Debora Donato:
  Graph Structures and Algorithms for Query-Log Analysis. 126-131
  
• Dominic Dumrauf, Tim Süß:
  On the Complexity of Local Search for Weighted Standard Set Problems. 132-140
  
• Martín Hötzel Escardó, Paulo Oliva:
  Computational Interpretations of Analysis via Products of Selection Functions. 141-150
  
• Martín Hötzel Escardó, Paulo Oliva:
  The Peirce Translation and the Double Negation Shift. 151-161
  
• Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies:
  Counting the Changes of Random D⁰₂{\Delta^0_2} Sets. 162-171
  
• Michèle Friend:
  Boole: From Calculating Numbers to Calculating Thoughts. 172-179
  
• Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek:
  Approximability and Hardness in Multi-objective Optimization. 180-189
  
• Kojiro Higuchi:
  P_w{\cal P}_w Is Not a Heyting Algebra. 190-194
  
• John M. Hitchcock:
  Lower Bounds for Reducibility to the Kolmogorov Random Strings. 195-200
  
• Jeannette Janssen:
  Spatial Models for Virtual Networks. 201-210
  
• Natasa Jonoska, Masahico Saito:
  DNA Rearrangements through Spatial Graphs. 211-218
  
• Bakhadyr Khoussainov, Andrey Morozov:
  On Index Sets of Some Properties of Computable Algebras. 219-228
  
• Bjørn Kjos-Hanssen, Jan Reimann:
  The Strength of the Besicovitch-Davies Theorem. 229-238
  
• Arist Kojevnikov, Alexander S. Kulikov:
  Circuit Complexity and Multiplicative Complexity of Boolean Functions. 239-245
  
• Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva:
  Definability in the Subword Order. 246-255
  
• Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov:
  Undecidability in Weihrauch Degrees. 256-265
  
• Jiang Liu, Guohua Wu:
  Degrees with Almost Universal Cupping Property. 266-275
  
• Giuseppe Longo:
  Incomputability in Physics. 276-285
  
• Jack H. Lutz, Brad Shutters:
  Approximate Self-assembly of the Sierpinski Triangle. 286-295
  
• Florin Manea, Carlos Martín-Vide, Victor Mitrana:
  Hairpin Lengthening. 296-306
  
• Yuri I. Manin:
  Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program. 307-316
  
• Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron:
  Computational Complexity Aspects in Membrane Computing. 317-320
  
• Alexander G. Melnikov:
  Computable Ordered Abelian Groups and Fields. 321-330
  
• Samuel Mimram:
  Focusing in Asynchronous Games. 331-341
  
• Jeff B. Paris, Soroush R. Rad:
  A Note on the Least Informative Model of a Theory. 342-351
  
• Olga Pombo:
  Three Roots for Leibniz's Contribution to the Computational Conception of Reason. 352-361
  
• Yasubumi Sakakibara:
  Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo. 362-371
  
• Rahul Santhanam:
  The Complexity of Explicit Constructions. 372-375
  
• Andre Souto:
  Kolmogorov Complexity Cores. 376-385
  
• Dieter Spreen:
  Every D⁰₂\Delta^0_2-Set Is Natural, Up to Turing Equivalence. 386-393
  
• Rebecca M. Steiner:
  Computable Fields and Weak Truth-Table Reducibility. 394-405
  
• Lutz Straßburger:
  What Is the Problem with Proof Nets for Classical Logic? 406-416
  
• Trifon Trifonov:
  Quasi-linear Dialectica Extraction. 417-426
  
• Sara L. Uckelman:
  Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole. 427-437
  
• David H. Wolpert:
  Inference Concerning Physical Systems. 438-447
  

Last update Thu May 24 02:41:59 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page