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.

RANDOMNESS IN ARITHMETIC

    In M. E. Carvallo, Nature, Cognition and System, Vol. 3, Kluwer, 1992.

    https://doi.org/10.1142/9789812796493_0012Cited by:0 (Source: Crossref)
    Abstract:

    The following sections are included:

    • History

    • How to toss a coin?

    • Information theory

    • Undecidability of halting problem (Turing 1936)

    • The halting probability Ω

    • “Computing” Ω in the limit

    • Equation for Ω

    • Solvable/unsolvable?

    • Finitely/infinitely many solutions?

    • Universal diophantine equation

    • Constructing the equation

    • Toy pure LISP

    • LISP register machine

    • Summary

    • References