Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
The logical depth of a {\em reversible} Turing machine equals the shortest running time of a shortest program for it. This is applied to show that the result in L.F. Antunes, A. Souto, and P.M.B. Vitányi, On the Rate of Decrease in Logical Depth, Theor. Comput. Sci., 702(2017), 60--64 is valid notwithstanding the error noted in Corrigendum P.M.B. Vitányi, Corrigendum to "On the rate of decrease in logical depth" by L.F. Antunes, A. Souto, and P.M.B. Vitányi [Theoret. Comput. Sci. 702 (2017) 60--64], {\em Theoret. Comput. Sci.}, https://doi.org/10.1016/j.tcs.2018.07.009 . /
cs.CC↗