Abstract is missing.
- Cupping Computably Enumerable Degrees SimultaneouslyHong Hanh Tran, Guohua Wu. 3-16 [doi]
- The Relationship Between Local and Global Structure in the Enumeration DegreesMariya Ivanova Soskova. 17-22 [doi]
- Direct Construction of Scott IdealsRussell G. Miller. 23-34 [doi]
- The Non-normal Abyss in Kleene's Computability TheorySam Sanders. 37-49 [doi]
- A Constructive Picture of Noetherian Conditions and Well Quasi-ordersGabriele Buriola, Peter Schuster 0001, Ingo Blechschmidt. 50-62 [doi]
- Symmetry for Transfinite ComputabilityLorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe. 65-76 [doi]
- All Melodies Are Lost - Recognizability for Weak and Strong α-Register MachinesMerlin Carl. 77-88 [doi]
- De Groot Duality for Represented SpacesTakayuki Kihara, Arno Pauly. 89-101 [doi]
- Some Games on Turing Machines and Power from Random StringsAlexey Milovanov. 105-119 [doi]
- Inequalities for Entropies and DimensionsAlexander Shen. 120-131 [doi]
- Elementarily Traceable Irrational NumbersKeita Hiroshima, Akitoshi Kawamura. 135-140 [doi]
- Logic vs Topology on Regular ømega-languagesVladislav Orekhovskii, Victor L. Selivanov. 141-153 [doi]
- Subrecursive Graphs of Representations of Irrational NumbersIvan Georgiev. 154-165 [doi]
- On the Complexity of Learning ProgramsVasco Brattka. 166-177 [doi]
- The Complexity of Finding SupergraphsVittorio Cipriani, Arno Pauly. 178-189 [doi]
- Extending Wagner's Hierarchy to Deterministic Visibly Pushdown AutomataVictor L. Selivanov. 190-201 [doi]
- On Guarded Extensions of MMSNPAlexey Barsukov, Florent R. Madelaine. 202-213 [doi]
- Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit DynamicsPacôme Perrotin, Sylvain Sené. 214-228 [doi]
- Structural Complexity of Rational Interactive ProofsDaniil Musatov, Georgii Potapov. 231-245 [doi]
- Physical Zero-Knowledge Proof for Ball Sort PuzzleSuthee Ruangwises. 246-257 [doi]
- Graph SubshiftsPablo Arrighi, Amélia Durbec, Pierre Guillon 0001. 261-274 [doi]
- Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity GamesPawel Parys, Aleksander Wiacek. 275-286 [doi]
- An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-PathsZeev Nutov. 287-296 [doi]