- Olivier Bournez, Riccardo Gozzi. Set descriptive complexity of solvable functions. Computability, 14(3-4):178-197, 2025.
- Caleb Davis, Jeffry L. Hirst, Silva Keohulian, Brody Miller, Jessica Ross. Reverse mathematics of a color basis theorem. Computability, 14(2):128-135, 2025.
- Nicanor Carrasco-Vargas. Infinite Eulerian paths are computable on graphs with vertices of infinite degree. Computability, 14(2):95-110, 2025.
- Sam Sanders. On the computational properties of the Baire category theorem. Computability, 14(3-4):157-171, 2025.
- Uri Andrews, Steffen Lempp, Alberto Marcone, Joseph S. Miller, Manlio Valenti. A jump operator on the Weihrauch degrees. Computability, 14(2):73-94, 2025.
- Masahiro Kumabe, Kenshi Miyabe, Toshio Suzuki. Solovay reducibility via Lipschitz functions and signed-digit representation. Computability, 14(1):38-62, 2025.
- Makoto Fujiwara, Takako Nemoto. Choice principles characterizing the difference between König's lemma and weak König's lemma in constructive reverse mathematics. Computability, 14(1):30-37, 2025.
- Irakli O. Chitaia, Valentino Delle Rose, Andrea Sorbi. On the transversals of a ceer. Computability, 14(2):111-127, 2025.
- Patrick Uftring. Weihrauch degrees without roots. Computability, 14(1):17-29, 2025.
- Pavel Alaev, Victor L. Selivanov. Complexity issues for the iterated h-preorders. Computability, 14(3-4):139-156, 2025.