4,095 research outputs found

    On Logical Depth and the Running Time of Shortest Programs

    Get PDF
    The logical depth with significance bb of a finite binary string xx is the shortest running time of a binary program for xx that can be compressed by at most bb bits. There is another definition of logical depth. We give two theorems about the quantitative relation between these versions: the first theorem concerns a variation of a known fact with a new proof, the second theorem and its proof are new. We select the above version of logical depth and show the following. There is an infinite sequence of strings of increasing length such that for each jj there is a bb such that the logical depth of the jjth string as a function of jj is incomputable (it rises faster than any computable function) but with bb replaced by b+1b+1 the resuling function is computable. Hence the maximal gap between the logical depths resulting from incrementing appropriate bb's by 1 rises faster than any computable function. All functions mentioned are upper bounded by the Busy Beaver function. Since for every string its logical depth is nonincreasing in bb, the minimal computation time of the shortest programs for the sequence of strings as a function of jj rises faster than any computable function but not so fast as the Busy Beaver function.Comment: 12 pages LaTex (this supercedes arXiv:1301.4451
    • …
    corecore