Abstract is missing.
- Recent Advances in the Computation of the Homology of Semialgebraic SetsFelipe Cucker. 1-12 [doi]
- Surreal Blum-Shub-Smale MachinesLorenzo Galeotti. 13-24 [doi]
- Non-Recursive Trade-Offs Are "Almost Everywhere"Markus Holzer 0001, Martin Kutrib. 25-36 [doi]
- Probabilistic Analysis of Facility Location on Random Shortest Path MetricsStefan Klootwijk, Bodo Manthey. 37-49 [doi]
- Uniform RelativizationKenshi Miyabe. 50-61 [doi]
- Correctness, Explanation and IntentionRaymond Turner. 62-71 [doi]
- Higher Type Recursion for Transfinite Machine TheoryPhilip Welch. 72-83 [doi]
- Effective Embeddings for Pairs of StructuresNikolay Bazhenov, Hristo Ganchev, Stefan Vatev. 84-95 [doi]
- Bounded Reducibility for Computable NumberingsNikolay Bazhenov, Manat Mustafa, Sergei Ospichev. 96-107 [doi]
- Complexity of Conjunctive Regular Path Query HomomorphismsLaurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard. 108-119 [doi]
- Towards Uniform Online Spherical TessellationsPaul C. Bell, Igor Potapov. 120-131 [doi]
- Complexity of Maximum Fixed Point Problem in Boolean NetworksFlorian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard. 132-143 [doi]
- A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ )Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen. 144-155 [doi]
- Study of Stepwise Simulation Between ASMPatrick Cégielski, Julien Cervelle. 156-167 [doi]
- Cohesive Powers of Linear OrdersRumen D. Dimitrov, Valentina S. Harizanov, Andrey Morozov, Paul Shafer, Alexandra A. Soskova, Stefan Vatev. 168-180 [doi]
- An algorithmic approach to characterizations of admissiblesBruno Durand, Grégory Lafitte. 181-192 [doi]
- 3s by Deleting Few EdgesNiels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer. 193-204 [doi]
- Degree Spectra for Transcendence in FieldsIskander Sh. Kalimullin, Russell G. Miller, Hans Schoutens. 205-216 [doi]
- More Intensional Versions of Rice's TheoremJean-Yves Moyen, Jakob Grue Simonsen. 217-229 [doi]
- On Approximate Uncomputability of the Kolmogorov Complexity FunctionRuslan Ishkuvatov, Daniil Musatov. 230-239 [doi]
- Borel and Baire Sets in Bishop SpacesIosif Petrakis. 240-252 [doi]
- Nets and Reverse Mathematics - Some Initial ResultsSam Sanders. 253-264 [doi]
- Kalmár's Argument for the Independence of Computer ScienceMáté Szabó. 265-276 [doi]
- The d.r.e wtt-Degrees are DenseShaoyi Wang, Guohua Wu, Mars M. Yamaleev. 277-285 [doi]
- Finite State Machines with Feedback: An Architecture Supporting Minimal Machine ConsciousnessJirí Wiedermann, Jan van Leeuwen. 286-297 [doi]
- Representations of Natural Numbers and Computability of Various FunctionsMichal Wroclawski. 298-309 [doi]
- On the Differences and Sums of Strongly Computably Enumerable Real NumbersKlaus Ambos-Spies, Xizhong Zheng. 310-322 [doi]