Abstract is missing.
- A Note on Computable Embeddings for Ordinals and Their ReversesNikolay Bazhenov, Stefan Vatev. 1-13 [doi]
- Clockability for Ordinal Turing MachinesMerlin Carl. 14-25 [doi]
- Some Notes on Spaces of Ideals and Computable TopologyMatthew de Brecht. 26-37 [doi]
- Parallelizations in Weihrauch Reducibility and Constructive Reverse MathematicsMakoto Fujiwara. 38-49 [doi]
- Liouville Numbers and the Computational Complexity of Changing BasesSune Kristian Jakobsen, Jakob Grue Simonsen. 50-62 [doi]
- On Interpretability Between Some Weak Essentially Undecidable TheoriesLars Kristiansen, Juvenal Murwanashyaka. 63-74 [doi]
- On the Complexity of Conversion Between Classic Real Number RepresentationsLars Kristiansen, Jakob Grue Simonsen. 75-86 [doi]
- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional PowerMartin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. 87-99 [doi]
- Computable Analysis and Classification ProblemsRodney G. Downey, Alexander G. Melnikov. 100-111 [doi]
- Non-coding Enumeration OperatorsRussell Miller. 112-123 [doi]
- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive NumberingsThomas Zeugmann. 124-136 [doi]
- Prawf: An Interactive Proof System for Program ExtractionUlrich Berger 0001, Olga Petrovska, Hideki Tsuiki. 137-148 [doi]
- ASNP: A Tame Fragment of Existential Second-Order LogicManuel Bodirsky, Simon Knäuer, Florian Starke. 149-162 [doi]
- Ackermannian Goodstein Sequences of Intermediate GrowthDavid Fernández Duque, Andreas Weiermann. 163-174 [doi]
- On the Complexity of Validity Degrees in Łukasiewicz LogicZuzana Haniková. 175-188 [doi]
- Degrees of Non-computability of Homeomorphism Types of Polish SpacesMathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov. 189-192 [doi]
- Time-Aware Uniformization of Winning StrategiesStéphane Le Roux 0001. 193-204 [doi]
- Quantitative Coding and Complexity Theory of Compact Metric SpacesDonghyun Lim, Martin Ziegler 0001. 205-214 [doi]
- Functions of Baire Class One over a Bishop TopologyIosif Petrakis. 215-227 [doi]
- Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind ArraysAndrea Frosini, G. Palma, Simone Rinaldi. 228-238 [doi]
- The Computational Significance of Hausdorff's Maximal Chain PrinciplePeter Schuster 0001, Daniel Wessel. 239-250 [doi]
- Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency GraphsCyril Banderier, Massimiliano Goldwurm. 251-263 [doi]
- Repetitions in Toeplitz Words and the Thue ThresholdAntonio Boccuto, Arturo Carpi. 264-276 [doi]
- On Simulation in Automata NetworksFlorian Bridoux, Maximilien Gadouleau, Guillaume Theyssier. 277-288 [doi]
- Theoretical and Implementational Aspects of the Formal Language Server (LaSer)Stavros Konstantinidis. 289-295 [doi]
- Balancing Straight-Line Programs for Strings and TreesMarkus Lohrey. 296-300 [doi]
- Two-Dimensional CodesMaria Madonia. 301-305 [doi]
- Formal Languages in Information Extraction and Graph DatabasesWim Martens. 306-309 [doi]
- On the Perceptron's CompressionShay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff. 310-325 [doi]
- #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition MethodCamille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini. 326-338 [doi]
- Faster Online Computation of the Succinct Longest Previous Factor ArrayNicola Prezza, Giovanna Rosone. 339-352 [doi]
- Recent Advances in Text-to-Pattern Distance AlgorithmsPrzemyslaw Uznanski. 353-365 [doi]
- Insertion-Deletion Systems with Substitutions IMartin Vu, Henning Fernau. 366-378 [doi]