Abstract is missing.
- Avoiding Simplicity Is ComplexEric Allender. 1-10 [doi]
- Higher-Order ContainersThorsten Altenkirch, Paul Levy, Sam Staton. 11-20 [doi]
- On the Completeness of Quantum Computation ModelsPablo Arrighi, Gilles Dowek. 21-30 [doi]
- The Ordinal of Skolem + Tetration Is ::::tau::::::0::Mathias Barra, Philipp Gerhardy. 31-38 [doi]
- Proofs, Programs, ProcessesUlrich Berger, Monika Seisenberger. 39-48 [doi]
- Ergodic-Type Characterizations of Algorithmic RandomnessLaurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen. 49-58 [doi]
- How Powerful Are Integer-Valued Martingales?Laurent Bienvenu, Frank Stephan, Jason Teutsch. 59-68 [doi]
- A Faster Algorithm for Finding Minimum Tucker SubmatricesGuillaume Blin, Romeo Rizzi, Stéphane Vialette. 69-77 [doi]
- Processes in SpaceLuca Cardelli, Philippa Gardner. 78-87 [doi]
- Computability of Countable SubshiftsDouglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman. 88-97 [doi]
- The Limits of Tractability in Resolution-Based Propositional Proof SystemsStefan S. Dantchev, Barnaby Martin. 98-107 [doi]
- Haskell before Haskell: Curry s Contribution to Programming (1946-1950)Liesbeth De Mol, Maarten Bullynck, Martin Carlé. 108-117 [doi]
- A Miniaturisation of Ramsey s TheoremMichiel De Smet, Andreas Weiermann. 118-125 [doi]
- Graph Structures and Algorithms for Query-Log AnalysisDebora Donato. 126-131 [doi]
- On the Complexity of Local Search for Weighted Standard Set ProblemsDominic Dumrauf, Tim Süß. 132-140 [doi]
- Computational Interpretations of Analysis via Products of Selection FunctionsMartín Hötzel Escardó, Paulo Oliva. 141-150 [doi]
- The Peirce Translation and the Double Negation ShiftMartín Hötzel Escardó, Paulo Oliva. 151-161 [doi]
- Counting the Changes of Random D:::0:::::2::{/Delta^0_2} SetsSantiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies. 162-171 [doi]
- Boole: From Calculating Numbers to Calculating ThoughtsMichèle Friend. 172-179 [doi]
- Approximability and Hardness in Multi-objective OptimizationChristian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek. 180-189 [doi]
- w{\cal P}_w Is Not a Heyting AlgebraKojiro Higuchi. 190-194 [doi]
- Lower Bounds for Reducibility to the Kolmogorov Random StringsJohn M. Hitchcock. 195-200 [doi]
- Spatial Models for Virtual NetworksJeannette Janssen. 201-210 [doi]
- DNA Rearrangements through Spatial GraphsNatasa Jonoska, Masahico Saito. 211-218 [doi]
- On Index Sets of Some Properties of Computable AlgebrasBakhadyr Khoussainov, Andrey Morozov. 219-228 [doi]
- The Strength of the Besicovitch-Davies TheoremBjørn Kjos-Hanssen, Jan Reimann. 229-238 [doi]
- Circuit Complexity and Multiplicative Complexity of Boolean FunctionsArist Kojevnikov, Alexander S. Kulikov. 239-245 [doi]
- Definability in the Subword OrderOleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva. 246-255 [doi]
- Undecidability in Weihrauch DegreesOleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov. 256-265 [doi]
- Degrees with Almost Universal Cupping PropertyJiang Liu 0002, Guohua Wu. 266-275 [doi]
- Incomputability in PhysicsGiuseppe Longo. 276-285 [doi]
- Approximate Self-assembly of the Sierpinski TriangleJack H. Lutz, Brad Shutters. 286-295 [doi]
- Hairpin LengtheningFlorin Manea, Carlos Martín-Vide, Victor Mitrana. 296-306 [doi]
- Infinities in Quantum Field Theory and in Classical Computing: Renormalization ProgramYuri I. Manin. 307-316 [doi]
- Computational Complexity Aspects in Membrane ComputingGiancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron. 317-320 [doi]
- Computable Ordered Abelian Groups and FieldsAlexander G. Melnikov. 321-330 [doi]
- Focusing in Asynchronous GamesSamuel Mimram. 331-341 [doi]
- A Note on the Least Informative Model of a TheoryJeff B. Paris, Soroush R. Rad. 342-351 [doi]
- Three Roots for Leibniz's Contribution to the Computational Conception of ReasonOlga Pombo. 352-361 [doi]
- Development of a Bacteria Computer: From ::::in silico:::: Finite Automata to ::::in vitro:::: and ::::in vivo::::Yasubumi Sakakibara. 362-371 [doi]
- The Complexity of Explicit ConstructionsRahul Santhanam. 372-375 [doi]
- Kolmogorov Complexity CoresAndre Souto. 376-385 [doi]
- Every D:::0:::::2::/Delta^0_2-Set Is Natural, Up to Turing EquivalenceDieter Spreen. 386-393 [doi]
- Computable Fields and Weak Truth-Table ReducibilityRebecca M. Steiner. 394-405 [doi]
- What Is the Problem with Proof Nets for Classical Logic?Lutz Straßburger. 406-416 [doi]
- Quasi-linear Dialectica ExtractionTrifon Trifonov. 417-426 [doi]
- Computing with Concepts, Computing with Numbers: Llull, Leibniz, and BooleSara L. Uckelman. 427-437 [doi]
- Inference Concerning Physical SystemsDavid H. Wolpert. 438-447 [doi]