I will discuss Leibniz's ideas on complexity (Discours de metaphysique, 1686), leading to modern work on program-size complexity, the halting probability and incompleteness. Leibniz's principle of sufficient reason asserts that if anything is true it is true for a reason. But the bits of the numerical value of the halting probability are mathematical truths that are true for no reason. More precisely, as I will explain, they are irreducible mathematical truths, that is, true for no reason simpler than themselves.

To watch the video simply click on the image bellow:

Leibniz, Complexity and Incompleteness

Gregory Chaitin

Old NID
67855

Donate

Please donate so science experts can write for the public.

At Science 2.0, scientists are the journalists, with no political bias or editorial control. We can't do it alone so please make a difference.

Donate with PayPal button 
We are a nonprofit science journalism group operating under Section 501(c)(3) of the Internal Revenue Code that's educated over 300 million people.

You can help with a tax-deductible donation today and 100 percent of your gift will go toward our programs, no salaries or offices.

Latest reads

Article teaser image
Donald Trump does not have the power to rescind either constitutional amendments or federal laws by mere executive order, no matter how strongly he might wish otherwise. No president of the United…
Article teaser image
The Biden administration recently issued a new report showing causal links between alcohol and cancer, and it's about time. The link has been long-known, but alcohol carcinogenic properties have been…
Article teaser image
In British Iron Age society, land was inherited through the female line and husbands moved to live with the wife’s community. Strong women like Margaret Thatcher resulted.That was inferred due to DNA…