2019-01-28
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
Publication
Publication
Theoretical Computer Science , Volume 778 p. 78- 80
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].
| Additional Metadata | |
|---|---|
| , , | |
| doi.org/10.1016/j.tcs.2019.01.031 | |
| Theoretical Computer Science | |
| Organisation | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
|
Vitányi, P. (2019). Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. Theoretical Computer Science, 778, 78–80. doi:10.1016/j.tcs.2019.01.031 |
|
