Computing and evolving variants of computational depth

Abstract

This manuscript has been reproduced fi-om the imcrofilm master. UMI films the text directly fi'om the origiiial or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, whUe others may be fi-om any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely a£fect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand comer and continuing fi'om left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book.

Minimal history, a theory of plausible explanation

“…Thus, the identification of feasibly computable estimators of depth (or minimal history) remains an important challenge. That this may be possible is suggested by the work of Lathrop [11,12]. Feasibly computable measures of depth would allow computer experiments that explore the nature of various processes that generate depth.…”