Abstract is missing.
- Character-Based Phylogeny Construction and Its Application to Tumor EvolutionGianluca Della Vedova, Murray Patterson, Raffaella Rizzi, Mauricio Soto. 3-13 [doi]
- Is there any Real Substance to the Claims for a 'New Computationalism'?Alberto Hernández-Espinosa, Francisco Hernández Quiroz, Héctor Zenil. 14-23 [doi]
- Formalizing a Fragment of Combinatorics on WordsStepan Holub, Robert Veroff. 24-31 [doi]
- Turing's 1949 Paper in ContextCliff B. Jones. 32-41 [doi]
- Gödel's Reception of Turing's Model of Computability: The "Shift of Perception" in 1934Juliette Kennedy. 42-49 [doi]
- A Guided Tour to Computational HaplotypingGunnar W. Klau, Tobias Marschall. 50-63 [doi]
- Outline of Partial Computability in Computable TopologyMargarita V. Korovina, Oleg V. Kudinov. 64-76 [doi]
- Eliminating Unbounded Search in Computable AlgebraAlexander G. Melnikov. 77-87 [doi]
- Computable Transformations of StructuresRussell G. Miller. 88-97 [doi]
- Formulas with ReversalNarad Rampersad. 98-100 [doi]
- Compressibility and Probabilistic ProofsAlexander Shen. 101-111 [doi]
- Delayed-Input Cryptographic ProtocolsIvan Visconti. 112-115 [doi]
- A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small DiscrepancyStefan Arnold, Jacobo Torán. 119-128 [doi]
- Counting Substrate Cycles in Topologically Restricted Metabolic NetworksRobert D. Barish, Akira Suyama. 129-140 [doi]
- Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear OrdersNikolay Bazhenov. 141-151 [doi]
- Degrees of Categoricity of Rigid StructuresNikolay Bazhenov, Mars M. Yamaleev. 152-161 [doi]
- Flexible Indexing of Repetitive CollectionsDjamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot. 162-174 [doi]
- Admissibles in GapsMerlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani. 175-186 [doi]
- Koepke Machines and Satisfiability for Infinitary Propositional LanguagesMerlin Carl, Benedikt Löwe, Benjamin G. Rin. 187-197 [doi]
- The Recognizability Strength of Infinite Time Turing Machines with Ordinal ParametersMerlin Carl, Philipp Schlicht. 198-209 [doi]
- New Bounds on the Strength of Some Restrictions of Hindman's TheoremLorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski. 210-220 [doi]
- Infinite Time Busy BeaversOscar Defrain, Bruno Durand, Grégory Lafitte. 221-233 [doi]
- Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton GroupsMartin Delacourt, Nicolas Ollinger. 234-245 [doi]
- Towards Computable Analysis on the Generalised Real LineLorenzo Galeotti, Hugo Nobrega. 246-257 [doi]
- Finite Language Forbidding-Enforcing SystemsDaniela Genova, Hendrik Jan Hoogeboom. 258-269 [doi]
- Surjective H-Colouring: New Hardness ResultsPetr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart. 270-281 [doi]
- On Higher Effective Descriptive Set TheoryMargarita V. Korovina, Oleg V. Kudinov. 282-291 [doi]
- 2Karoliina Lehtinen, Sandra Quickert. 292-303 [doi]
- Dimension Spectra of LinesNeil Lutz, Donald M. Stull. 304-314 [doi]
- A Universal Oracle for Signal MachinesThierry Monteil 0002. 315-326 [doi]
- Game Characterizations and Lower Cones in the Weihrauch DegreesHugo Nobrega, Arno Pauly. 327-337 [doi]
- Randomness DeficienciesGleb Novikov. 338-350 [doi]
- McShane-Whitney PairsIosif Petrakis. 351-363 [doi]
- Total Nondeterministic Turing Machines and a p-optimal Proof System for SATZenon Sadowski. 364-374 [doi]
- A One-Dimensional Physically Universal Cellular AutomatonVille Salo, Ilkka Törmä. 375-386 [doi]
- Extending Wadge Theory to k-PartitionsVictor L. Selivanov. 387-399 [doi]