All Stories

  1. Computational complexity and the conjugacy problem

    Article • Computability, October 2017, IOS Press

    Prof Paul E Schupp

  2. COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS

    Article • Journal of Symbolic Logic, August 2016, Cambridge University Press

    Prof Paul E Schupp

  3. Asymptotic density and the coarse computability bound

    Article • Computability, February 2016, IOS Press

    Prof Paul E Schupp