Search (3 results, page 1 of 1)

  • × author_ss:"Chaitin, G.J."
  • × type_ss:"a"
  1. Chaitin, G.J.: Gödel's theorem and information (1982) 0.00 
    0.0016307352 = product of:
  0.022830293 = sum of:
    0.022830293 = weight(_text_:information in 2448) [ClassicSimilarity], result of:
      0.022830293 = score(doc=2448,freq=4.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.43886948 = fieldWeight in 2448, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=2448)
  0.071428575 = coord(1/14)
    Theme
    Information
  2. Chaitin, G.J.: Algorithmic information theory (1977) 0.00 
    0.0014122581 = product of:
  0.019771613 = sum of:
    0.019771613 = weight(_text_:information in 601) [ClassicSimilarity], result of:
      0.019771613 = score(doc=601,freq=12.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.38007212 = fieldWeight in 601, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=601)
  0.071428575 = coord(1/14)
    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.
    Theme
    Information
  3. Chaitin, G.J.: Grenzen der Berechenbarkeit (2004) 0.00 
    5.7655195E-4 = product of:
  0.008071727 = sum of:
    0.008071727 = weight(_text_:information in 2422) [ClassicSimilarity], result of:
      0.008071727 = score(doc=2422,freq=2.0), product of:
        0.052020688 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.029633347 = queryNorm
        0.1551638 = fieldWeight in 2422, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2422)
  0.071428575 = coord(1/14)
    Content
    Mit Kapiteln zu: Russells Paradoxon - Hilberts Rettungsversuch - Die Gödel'sche Unvollständigkeit - Turings Maschine - Der Zufall in der Mathematik - Information und Entropie

Years

Languages