English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The logical depth of a {\em reversible} Turing machine equals the shortestrunning time of a shortest program for it. This is applied to show that theresult in L.F. Antunes, A. Souto, and P.M.B. Vit\'anyi, On the Rate of Decreasein Logical Depth, Theor. Comput. Sci., 702(2017), 60--64 is validnotwithstanding the error noted in Corrigendum P.M.B. Vit\'anyi, Corrigendum to"On the rate of decrease in logical depth" by L.F. Antunes, A. Souto, andP.M.B. Vit\'anyi [Theoret. Comput. Sci. 702 (2017) 60--64], {\em Theoret.Comput. Sci.}, https://doi.org/10.1016/j.tcs.2018.07.009 . /

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