DeepAI AI Chat
Log In Sign Up

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

by   Paul MB Vitanyi, et al.
Centrum Wiskunde & Informatica

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., . /


page 1

page 2

page 3

page 4


The group of reversible Turing machines: subgroups, generators and computability

We study an abstract group of reversible Turing machines. In our model, ...

Logical N-AND Gate on a Molecular Turing Machine

In Boolean algebra, it is known that the logical function that correspon...

Revisiting the simulation of quantum Turing machines by quantum circuits

Yao (1993) proved that quantum Turing machines and uniformly generated q...

Arithmetic logical Irreversibility and the Turing's Halt Problem

The Turing machine halting problem can be explained by several factors, ...

Relativity of Depth and Sophistication

Logical depth and sophistication are two quantitative measures of the no...

A certifying extraction with time bounds from Coq to call-by-value λ-calculus

We provide a plugin extracting Coq functions of simple polymorphic types...

Organized Complexity: is Big History a Big Computation?

The concept of "logical depth" introduced by Charles H. Bennett (1988) s...