Abstract is missing.
- Searching for Applicable Versions of Computable StructuresPavel Alaev, Victor L. Selivanov. 1-11 [doi]
- On Measure Quantifiers in First-Order ArithmeticMelissa Antonelli, Ugo Dal Lago, Paolo Pistone. 12-24 [doi]
- Learning Languages with Decidable HypothesesJulian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters 0001, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger. 25-37 [doi]
- Robust Online Algorithms for Dynamic Choosing ProblemsSebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche. 38-49 [doi]
- On the Degrees of Constructively Immune SetsSamuel D. Birns, Bjørn Kjos-Hanssen. 50-59 [doi]
- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational GeometryKarl Bringmann. 60-70 [doi]
- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale MachinesMerlin Carl. 71-81 [doi]
- Randomising RealizabilityMerlin Carl, Lorenzo Galeotti, Robert Paßmann. 82-93 [doi]
- Restrictions of Hindman's Theorem: An OverviewLorenzo Carlucci. 94-105 [doi]
- Complexity and Categoricity of Injection Structures Induced by Finite State TransducersRichard Krogman, Douglas Cenzer. 106-119 [doi]
- A Tale of Optimizing the Space Taken by de Bruijn GraphsRayan Chikhi. 120-134 [doi]
- Formally Computing with the Non-computableLiron Cohen 0001. 135-145 [doi]
- Mapping Monotonic Restrictions in Inductive InferenceVanja Doskoc, Timo Kötzing. 146-157 [doi]
- Normal Forms for Semantically Witness-Based Learners in Inductive InferenceVanja Doskoc, Timo Kötzing. 158-168 [doi]
- Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBluntedJordan M. Eizenga, Ryan Lorig-Roach, Melissa M. Meredith, Benedict Paten. 169-177 [doi]
- On 3SUM-hard Problems in the Decision Tree ModelEsther Ezra. 178-188 [doi]
- Limitwise Monotonic Spectra and Their GeneralizationsMarat Kh. Faizrahmanov. 189-198 [doi]
- On False Heine/Borel Compactness Principles in Proof MiningFernando Ferreira 0001. 199-203 [doi]
- Placing Green Bridges Optimally, with a Multivariate AnalysisTill Fluschnik, Leon Kellerhals. 204-216 [doi]
- A Church-Turing Thesis for Randomness?Johanna N. Y. Franklin. 217-226 [doi]
- Probabilistic Models of k-mer Frequencies (Extended Abstract)Askar Gafurov, Tomás Vinar, Brona Brejová. 227-236 [doi]
- Defining Formal Explanation in Classical Logic by Substructural DerivabilityFrancesco A. Genco, Francesca Poggiolesi. 237-247 [doi]
- Dedekind Cuts and Long Strings of Zeros in Base ExpansionsIvan Georgiev. 248-259 [doi]
- On the Impact of Treewidth in the Computational Complexity of Freezing DynamicsEric Goles 0001, Pedro Montealegre 0001, Martín Ríos Wilson, Guillaume Theyssier. 260-272 [doi]
- Towards a Map for Incremental Learning in the Limit from Positive and Negative InformationArdalan Khazraei, Timo Kötzing, Karen Seidel 0001. 273-284 [doi]
- On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising StrategyAngeliki Koutsoukou Argyraki. 285-296 [doi]
- In Search of the First-Order Part of Ramsey's Theorem for PairsLeszek Aleksander Kolodziejczyk, Keita Yokoyama. 297-307 [doi]
- On Subrecursive Representation of Irrational Numbers: Contractors and Baire SequencesLars Kristiansen. 308-317 [doi]
- Learning Languages in the Limit from Positive Information with Finitely Many Memory ChangesTimo Kötzing, Karen Seidel 0001. 318-329 [doi]
- Compression Techniques in Group TheoryMarkus Lohrey. 330-341 [doi]
- Computable Procedures for FieldsRussell Miller. 342-352 [doi]
- Minimum Classical Extensions of Constructive TheoriesJoan Rand Moschovakis, Garyfallia Vafeiadou. 353-362 [doi]
- Subrecursive Equivalence Relations and (non-)Closure Under Lattice OperationsJean-Yves Moyen, Jakob Grue Simonsen. 363-372 [doi]
- Interactive Physical ZKP for Connectivity: Applications to Nurikabe and HitoriLéo Robert, Daiki Miyahara, Pascal Lafourcade 0001, Takaaki Mizuki. 373-384 [doi]
- Positive Enumerable FunctorsBarbara F. Csima, Dino Rossegger, Daniel Yu. 385-394 [doi]
- Splittings and Robustness for the Heine-Borel TheoremSam Sanders. 395-406 [doi]
- Non-collapse of the Effective Wadge HierarchyVictor L. Selivanov. 407-416 [doi]
- Effective Inseparability and Its ApplicationsAndrea Sorbi. 417-423 [doi]
- Simple Betting and StochasticityTomasz Steifer. 424-433 [doi]
- Péter on Church's Thesis, Constructivity and ComputersMáté Szabó. 434-445 [doi]
- Constructive Mathematics, Church's Thesis, and Free Choice SequencesD. A. Turner. 446-456 [doi]
- KL-Randomness and Effective Dimension Under Strong ReducibilityBjørn Kjos-Hanssen, David J. Webb. 457-468 [doi]
- An Algorithmic Version of Zariski's LemmaFranziskus Wiesnet. 469-482 [doi]
- Einstein Meets Turing: The Computability of Nonlocal GamesHenry Yuen. 483-493 [doi]
- Computability of Limit Sets for Two-Dimensional FlowsDaniel Silva Graça, Ning Zhong 0002. 494-503 [doi]