|
|
|
|
|
|
 |
 |
|
Randomness in Arithmetic: Code from "Algorithmic Information Theory"
|
|
|
|
|
|
| Organization: | IBM Research Division |
|
|
|
|
|
|
0205-063
|
|
|
|
|
|
1993-06-08
|
|
|
|
|
|
In the book Algorithmic Information Theory, G. J. Chaitin explains how to construct a million-character equation that proves that there is randomness in arithmetic. The book only includes a few pages from the monster equation, and omits the software used to construct it. This software has now been rewritten in Mathematica. The Mathematica software for the book, and its input, are here in their entirety.
|
|
|
|
|
|
|
|
|
|
|
|
Pure Mathematics, Pure Math, Lisp Interpreter, Book Code, C language, C programming, LISP programming, Randomness in Arithmetic, Algorithmic Information Theory, Publications, readme.tex, readme.ps, Chaitin.tar.Z, Chaitin.zip, Chaitin.sit.hqx
|
|
|
|
|
|
| Chaitin.sit.hqx (94.4 KB) - Macintosh archive | | Chaitin.tar.Z (69.6 KB) - UNIX compressed file | | Chaitin.zip (51.4 KB) - ZIP archive | | readme.ps (86.7 KB) - Postscript file | | readme.tex (10.9 KB) - TeX document |
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
