World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
No Access

COMPLEXITY AND RANDOMNESS IN MATHEMATICS

    “Pensar la complexitat” Symposium, Barcelona, 4 November 1991.

    https://doi.org/10.1142/9789812796493_0014Cited by:0 (Source: Crossref)
    Previous
    Next
    Abstract:

    I have developed a mathematical theory of complexity, which I call “algorithmic information theory.” I have applied this theory to mathematics itself, and have shown that mathematics is not as simple as had been thought, and indeed that arithmetic contains infinite complexity and complete randomness. Here I shall give examples of my mathematical concept of complexity and how it is measured, outline its main properties, and discuss what it says about the limitations of mathematics.