These are working notes on placing Pathak’s [5] computability-flavored version of the Lebesgue differentiation theorem into the framework developed by Hoyrup and Rojas [3, 1, 2] for working with algorithmic randomness in “computable metric spaces.” I wrote this up for my own edification, as I am only just becoming familiar with algorithmic randomness in general.