- Douglas Cenzer, Christopher P. Porter. Randomness extraction in computability theory. Computability, 12(1):1-21, 2023.
- Djamel Eddine Amir, Mathieu Hoyrup. Strong computable type. Computability, 12(3):227-269, 2023.
- Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap. On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Computability, 12(2):145-173, 2023.
- Daniel Silva Graça, Ning Zhong. Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. Computability, 12(2):117-144, 2023.
- Marat Kh. Faizrahmanov. Numberings, c.e. oracles, and fixed points. Computability, 12(3):271-282, 2023.
- Victor L. Selivanov, Svetlana Selivanova. Primitive recursive ordered fields and some applications. Computability, 12(1):71-99, 2023.
- Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen. Approximating Kolmogorov complexity. Computability, 12(3):283-297, 2023.
- Riccardo Gozzi, Daniel Graça. Characterizing time computational complexity classes with polynomial differential equations. Computability, 12(1):23-57, 2023.
- Clara Löh, Matthias Uschold. L2-Betti numbers and computability of reals. Computability, 12(2):175-201, 2023.
- James Walsh 0007. Evitable iterates of the consistency operator. Computability, 12(1):59-69, 2023.