- Ivan Georgiev. Interplay between insertion of zeros and the complexity of Dedekind cuts. Computability, 13(2):135-159, 2024.
- Jack H. Lutz, Renrui Qi, Liang Yu. The Point-to-Set Principle and the dimensions of Hamel bases. Computability, 13(2):105-112, 2024.
- Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky. Enumerations of families closed under finite differences. Computability, 13(1):89-104, 2024.
- Klaus Ambos-Spies, Rod Downey, Martin Monath. Lowness properties for strong reducibilities and the computational power of maximal sets. Computability, 13(1):1-56, 2024.
- Sam Sanders. Exploring the abyss in Kleene's computability theory. Computability, 13(2):113-134, 2024.
- Dag Normann. Computability and non-monotone induction. Computability, 13(2):161-196, 2024.
- Peter Hertling, Philip Janicki. Nearly computable real numbers. Computability, 13(1):57-88, 2024.
- 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.