Incompleteness theorems for random reals

Authors:
G.J Chaitin
Affiliations:
IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598 USA
Venue:
Advances in Applied Mathematics
Year:
1987

Citing 0
Cited 7

Randomness and Reducibility

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Randomness, Computability, and Density

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The dimensions of individual strings and sequences

Information and Computation
Randomness and reducibility

Journal of Computer and System Sciences
On process complexity

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Closed left-R.E. sets

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Arithmetic complexity via effective names for random sequences

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We obtain some dramatic results using statistical mechanics-thermodynamics kinds of arguments concerning randomness, chaos, unpredictability, and uncertainty in mathematics. We construct an equation involving only whole numbers and addition, multiplication, and exponentiation, with the property that if one varies a parameter and asks whether the number of solutions is finite or infinite, the answer to this question is indistinguishable from the result of independent tosses of a fair coin. This yields a number of powerful Godel incompleteness-type results concerning the limitations of the axiomatic method, in which entropy-information measures are used.