-
Chaitin, G.J.: Gödel's theorem and information (1982)
0.01
0.009710376 = product of:
0.038841505 = sum of:
0.038841505 = weight(_text_:information in 2448) [ClassicSimilarity], result of:
0.038841505 = score(doc=2448,freq=4.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.25 = coord(1/4)
- Theme
- Information
-
Chaitin, G.J.: Algorithmic information theory (1977)
0.01
0.008409433 = product of:
0.033637732 = sum of:
0.033637732 = weight(_text_:information in 601) [ClassicSimilarity], result of:
0.033637732 = score(doc=601,freq=12.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = 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.25 = coord(1/4)
- 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
-
Chaitin, G.J.: Algorithmic information theory (1987)
0.01
0.005149705 = product of:
0.02059882 = sum of:
0.02059882 = weight(_text_:information in 4175) [ClassicSimilarity], result of:
0.02059882 = score(doc=4175,freq=8.0), product of:
0.08850355 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.050415643 = queryNorm
0.23274569 = fieldWeight in 4175, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=4175)
0.25 = coord(1/4)
- 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.
- Theme
- Information
