Year: 1995
Type: preprint
Abstract: The latest in a series of reports presenting the information-theoretic incompleteness theorems of algorithmic information theory via algorithms written in specially designed versions of LISP. Previously in this LISP code only one-character identifiers were allowed, and arithmetic had to be programmed out. Now identifiers can be many characters long, and arithmetic with arbitrarily large unsigned decimal integers is built in. This and many other changes in the software have made this material much easier to understand and to use.
Source: arXiv (Cornell University)
Author: Chaitin, G. J.
Institution: IBM (United States)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1877317474