Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines

08/28/2019
by   Paul MB Vitanyi, et al.
0

The logical depth of a 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], Theoret. Comput. Sci., https://doi.org/10.1016/j.tcs.2018.07.009 . /

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset