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 |
Proofs, Programs, Processes / Mathias Barra ; Philipp Gerhardy ; Ulrich Berger ; Monika Seisenberger |
Ergodic-Type Characterizations of Algorithmic Randomness / Laurent Bienvenu ; Adam Day ; Ilya Mezhirov ; Alexander Shen |
How Powerful Are Integer-Valued Martingales? / Frank Stephan ; Jason Teutsch |
A Faster Algorithm for Finding Minimum Tucker Submatrices / Guillaume Blin ; Romeo Rizzi ; Stéphane 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 Carlé |
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 Sü? |
Computational Interpretations of Analysis via Products of Selection Functions / MartÃn Escardó ; Paulo Oliva |
The Peirce Translation and the Double Negation Shift |
Boole: From Calculating Numbers to Calculating Thoughts / Santiago Figueira ; Denis Hirschfeldt ; Joseph S. Miller ; Keng Meng Ng ; André Nies ; Michèle Friend |
Approximability and Hardness in Multi-objective Optimization / Christian Gla?er ; Christian Reitwie?ner ; Heinz Schmitz ; Maximilian Witek |
Lower Bounds for Reducibility to the Kolmogorov Random Strings / Kojiro Higuchi ; John M. Hitchcock |
Spatial Models for Virtual Networks / Jeannette Janssen |
DNA Rearrangements through Spatial Graphs / Nataša Jonoska ; Masahico Saito |
On Index Sets of Some Properties of Computable Algebras / Bakhadyr Khoussainov ; Andrey Morozov |
The Strength of the Besicovitch-Davies Theorem / Bjørn 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 / 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 MartÃn-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 / André Souto |
Computable Fields and Weak Truth-Table Reducibility / Dieter Spreen ; 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 |
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 |