Search (3 results, page 1 of 1)

  • × author_ss:"Chaitin, G.J."
  • × type_ss:"m"
  1. Chaitin, G.J.: Conversations with a mathematician : Math, art, science and the limits of reason (2002) 0.00
    0.0020714647 = product of:
      0.0041429293 = sum of:
        0.0041429293 = product of:
          0.008285859 = sum of:
            0.008285859 = weight(_text_:a in 2212) [ClassicSimilarity], result of:
              0.008285859 = score(doc=2212,freq=12.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.15602624 = fieldWeight in 2212, product of:
                  3.4641016 = tf(freq=12.0), with freq of:
                    12.0 = termFreq=12.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=2212)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    G. J. Chaitin is at the IBM Thomas J. Watson Research Center in New York. He has shown that God plays dice not only in quantum mechanics, but even in the foundations of mathematics, where Chaitin discovered mathematical facts that are true for no reason, that are true by accident. This book collects his most wide-ranging and non-technical lectures and interviews, and it will be of interest to anyone concerned with the philosophy of mathematics, with the similarities and differences between physics and mathematics, or with the creative process and mathematics as an art. "Chaitin has put a scratch on the rock of eternity." Jacob T. Schwartz, Courant Institute, New York University, USA "(Chaitin is) one of the great ideas men of mathematics and computer science." Marcus Chown, author of The Magic Furnace, in NEW SCIENTIST "Finding the right formalization is a large component of the art of doing great mathematics." John Casti, author of Mathematical Mountaintops, on Godel, Turing and Chaitin in NATURE "What mathematicians over the centuries - from the ancients, through Pascal, Fermat, Bernoulli, and de Moivre, to Kolmogorov and Chaitin - have discovered, is that it ÄrandomnessÜ is a profoundly rich concept." Jerrold W. Grossman in the MATHEMATICAL INTELLIGENCER
    Content
    A Century of Controversy over the foundations of mathematics.- How to be a mathematician.- The creative life: science vs art.- Algorithmic information theory and the foundations of mathematics.- Randomness in arithmetic.- The reason for my life.- Undecidability and randomness in pure mathematics.- Math, science and fantasy.- Sensual mathematics.- Final thoughts.
  2. Chaitin, G.J.: ¬The limits of mathematics (1997) 0.00
    0.001913537 = product of:
      0.003827074 = sum of:
        0.003827074 = product of:
          0.007654148 = sum of:
            0.007654148 = weight(_text_:a in 974) [ClassicSimilarity], result of:
              0.007654148 = score(doc=974,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.14413087 = fieldWeight in 974, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0625 = fieldNorm(doc=974)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. It discusses Einstein and Gödel views of the nature of mathematics in the light of information theory, and sustains the thesis that mathematics is quasi-empirical. There is a foreword by Cris Calude of the University of Auckland, and supplementary material is available at the autor web site
  3. Chaitin, G.J.: Algorithmic information theory (1987) 0.00
    0.001757696 = product of:
      0.003515392 = sum of:
        0.003515392 = product of:
          0.007030784 = sum of:
            0.007030784 = weight(_text_:a in 4175) [ClassicSimilarity], result of:
              0.007030784 = score(doc=4175,freq=6.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.13239266 = fieldWeight in 4175, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046875 = fieldNorm(doc=4175)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.