Complexity Reference: compref48 (BibTex)

Authors: Bennett,CH

Year: 1988

Title: Logical Depth and Physical Complexity

Book Title: The Universal Turing Machine, A Half-Century Survey

Editors: Herken,R

Publisher: Oxford University Press, Oxford, pages: 227-257

Comments: Logical Depth is the time taken to compute a string from a very compressed program. Philsophy and applications are discussed.

Keywords: RANDOMNESS, COMPUTATIONAL, DEPTH, KOLMOGOROV, COMPLEXITY,

| Top | Authors | Journals | Years | Keywords | Search | New | Comments |


Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University