Rosennean Complexity and other interests
|
From March’s Notices of the AMS, Chaim Goodman-Strauss authors an article, “Can’t Decide? Undecide!” [1], on the ubiquity of undecidability in mathematics.
References
[1] Goodman-Strauss,C. 2010. “Can’t Decide? Undecide!”. Notices of the AMS. Vol 57:3.
A 2006 paper attempting to criticize some of Rosen’s arguments, entitled “In Defense of Mechanism” by A.J. Wells [1], was recently brought to my attention. The paper makes a lengthy series of erroneous arguments based on misinterpretations of Rosen’s arguments. Wells begins with a list of statements drawn from Rosen’s Life Itself [2]. He then […]
(Note: This post is a migration of a page form my old Rosen website.)
It is recommended that the reader first understand the Rosen Modeling Relation and Rosennean complexity prior to reading this page.
Introduction
The concept of “error”
Emergence
The mystery of emergence
References and footnotes
Introduction
Once we understand what is meant by Rosennean complexity, it becomes relatively easy to […]
In 1936, two important papers in the field of mathematics and logic were published. One was “An Unsolvable Problem of Elementary Number Theory” by Alonzo Church. [1] The other was “On computable numbers, with an application to the Entscheidungsproblem” by Alan Turing. [2] These papers were aimed at providing formal and rigorous definitions of the […]