Logical depth

Logical depth is a measure of complexity devised by Charles H. Bennett based on the computational complexity of an algorithm that can recreate a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The logical depth with significance $b$ of a finite binary string $x$ is the shortest running time of a binary program for $x…

2012

Usually one can quantify the subjective notion of useful information in two different perspectives: static resources…

2011

Boolean reversible logic has applications in various research areas including quantum computing. In this paper, a synthesis…

2009

Keywords: [MOBOTS] ; robotics ; microengineering Reference LSRO-CONF-2009-009 URL: http://www.aisb.org.uk/convention/aisb09/index…

2008

Adders are critical for microprocessor design. Current designs use variations of parallel prefix schemes. A method introduced by…

2007

Although the complexity of biological systems and subsystems like DNA and various transcription and translation pathways is of…

2006

We report on the results of computations concerning the linear complexities of the NLFSRs deployed in Achterbahn’s keystream…

2005

A new family of self-reset logic (SRL) cells is presented in this paper. The single-ended basic structure proposed realizes an…

2005

In this paper, we propose a class of division algorithms with the aim of reducing the delay of the selection of the quotient…

2001

Introduces computational depth, a measure for the amount of "non-random" or "useful" information in a string, by considering the…