Abstract is missing.
- Computers and the Mechanics of Communication - Outline of a Vision from the Work of Petri and HoltFelice Cardone. 3-12 [doi]
- Error and PredicativityLaura Crosilla. 13-22 [doi]
- Is Human Mind Fully Algorithmic? Remarks on Kurt Gödel's Incompleteness TheoremsMircea Dumitru. 23-33 [doi]
- A New Approach to the Paperfolding SequencesDaniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit. 34-43 [doi]
- Covering the Recursive SetsBjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn. 44-53 [doi]
- On Distributed Monitoring and SynthesisAnca Muscholl. 54-62 [doi]
- Unconventional Computing: Do We Dream Too Much?Gheorghe Paun. 63-70 [doi]
- Newton's Forward Difference Equation for Functions from Words to WordsJean-Éric Pin. 71-82 [doi]
- Degrees of Unsolvability: A TutorialStephen G. Simpson. 83-94 [doi]
- Universality in Molecular and Cellular ComputingSergey Verlan. 95-104 [doi]
- Some Results on Interactive Proofs for Real ComputationsMartijn Baartse, Klaus Meer. 107-116 [doi]
- Prime Model with No Degree of Autostability Relative to Strong ConstructivizationsNikolay Bazhenov. 117-126 [doi]
- Immune Systems in Computer VirologyGuillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup. 127-136 [doi]
- ITRM I T R M -Recognizability from Random OraclesMerlin Carl. 137-144 [doi]
- P Systems with Parallel Rewriting for Chain Code Picture LanguagesRodica Ceterchi, K. G. Subramanian, Ibrahim Venkat. 145-155 [doi]
- Base-Complexity Classifications of QCB _0 0 -SpacesMatthew de Brecht, Matthias Schröder, Victor L. Selivanov. 156-166 [doi]
- New Bounds on Optimal Sorting NetworksThorsten Ehlers, Mike Müller. 167-176 [doi]
- Nonexistence of Minimal Pairs in L[d]Chengling Fang, Jiang Liu 0002, Guohua Wu, Mars M. Yamaleev. 177-185 [doi]
- Intuitionistic Provability versus Uniform Provability in \mathsfRCA RCAMakoto Fujiwara. 186-195 [doi]
- Randomness and Differentiability of Convex FunctionsAlex Galicki. 196-205 [doi]
- Weighted Automata on Infinite Words in the Context of Attacker-Defender GamesVesa Halava, Tero Harju, Reino Niskanen, Igor Potapov. 206-215 [doi]
- Turing Jumps Through ProvabilityJoost J. Joosten. 216-225 [doi]
- Rice's Theorem in Effectively Enumerable Topological SpacesMargarita V. Korovina, Oleg V. Kudinov. 226-235 [doi]
- Decidability of Termination Problems for Sequential P Systems with Active MembranesMichal Kovác. 236-245 [doi]
- Weihrauch Degrees of Finding Equilibria in Sequential GamesStéphane Le Roux 0001, Arno Pauly. 246-257 [doi]
- Prefix and Right-Partial Derivative AutomataEva Maia, Nelma Moreira, Rogério Reis. 258-267 [doi]
- A Note on the Computable Categoricity of \ell ^p ℓ p SpacesTimothy H. McNicholl. 268-275 [doi]
- On the Computational Content of Termination ProofsGeorg Moser, Thomas Powell. 276-285 [doi]
- Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -completeAndré Nies, Slawomir Solecki. 286-290 [doi]
- Iterative Forcing and Hyperimmunity in Reverse MathematicsLudovic Patey. 291-301 [doi]
- Completely Regular Bishop SpacesIosif Petrakis. 302-312 [doi]
- Computing Equality-Free String FactorisationsMarkus L. Schmid. 313-323 [doi]
- Towards the Effective Descriptive Set TheoryVictor L. Selivanov. 324-333 [doi]
- On Computability of Navier-Stokes' EquationShu-Ming Sun, Ning Zhong, Martin Ziegler. 334-342 [doi]
- Kalmár and Péter: Undecidability as a Consequence of IncompletenessMáté Szabó. 343-352 [doi]
- How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation SystemsJeroen Van der Meeren, Andreas Weiermann. 353-362 [doi]