可逆图灵机的逻辑深度及其对一般图灵机逻辑深度下降率的应用
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
摘要：
{ \em可逆}图灵机的逻辑深度等于它的最短程序的最短运行时间。Antunes，A. Souto和P.M.B. Vitányi，论逻辑深度的下降率，Theor。Comput.科学，702（2017），60- 64是有效的，尽管在勘误表P.M.B.中指出了错误。Vitányi，Corrigendum to“On the rate of decrease in logical depth”by L.F. Antunes，A. Souto和P.M.B. Vitányi [Theoret. Sci. 702（2017）60- 64]，{ \em理论计算。Sci.}，https://doi.org/10.1016/j.tcs.2018.07.009的网站。/
英文摘要：
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 . /
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
