Search (2 results, page 1 of 1)

0.0062698447 = product of:
  0.012539689 = sum of:
    0.012539689 = product of:
      0.025079379 = sum of:
        0.025079379 = weight(_text_:m in 601) [ClassicSimilarity], result of:
          0.025079379 = score(doc=601,freq=2.0), product of:
            0.114023164 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.045820985 = queryNorm
            0.21994986 = fieldWeight in 601, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0625 = fieldNorm(doc=601)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented here and certain results of R. M. Solovay are reported.

0.0047023837 = product of:
  0.009404767 = sum of:
    0.009404767 = product of:
      0.018809535 = sum of:
        0.018809535 = weight(_text_:m in 4175) [ClassicSimilarity], result of:
          0.018809535 = score(doc=4175,freq=2.0), product of:
            0.114023164 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.045820985 = queryNorm
            0.1649624 = fieldWeight in 4175, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=4175)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Type

m