论文信息 - Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines - 字舞流文

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

Abstract 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 [1] is valid notwithstanding the error noted in Corrigendum [7] .

Paul M. B. Vitányi

[1] Robert Glück,et al. A Simple and Efficient Universal Reversible Turing Machine , 2011, LATA.

[2] Luis Filipe Coelho Antunes,et al. On the rate of decrease in logical depth , 2017, Theor. Comput. Sci..

[3] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[4] Rolf Herken,et al. The Universal Turing Machine: A Half-Century Survey , 1992 .

[5] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .

[6] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[7] Charles H. Bennett. Logical depth and physical complexity , 1988 .

[8] Paul M. B. Vitányi,et al. Corrigendum to "On the rate of decrease in logical depth" [Theor. Comput. Sci. 702 (2017) 60-64] by L.F. Antunes, A. Souto, and P.M.B. Vitányi , 2019, Theor. Comput. Sci..