Complexity Economics Engineering Medicine Society

Complexity Theorems – Theorem 3.

The following theorem provides further insight into what takes place at peak complexity of closed system.

What this shows is that at peak complexity, the number of entries of the adjacency matrix in C=f(S; E), i.e. n, starts to decrease. NB, we’re not saying that the maximum value of complexity corresponds to a global maximum. Basically, before a peak in complexity is reached, the system is building up structure. The moment complexity peaks, structure starts to dissolve.

Established originally in 2005 in the USA, Ontonix is a technology company headquartered in Como, Italy. The unusual technology and solutions developed by Ontonix focus on countering what most threatens safety, advanced products, critical infrastructures, or IT network security - the rapid growth of complexity. In 2007 the company received recognition by being selected as Gartner's Cool Vendor. What makes Ontonix different from all those companies and research centers who claim to manage complexity is that we have a complexity metric. This means that we MEASURE complexity. We detect anomalies in complex defense systems without using Machine Learning for one very good reason: our clients don’t have the luxury of multiple examples of failures necessary to teach software to recognize them. We identify anomalies without having seen them before. Sometimes, you must get it right the first and only time!

0 comments on “Complexity Theorems – Theorem 3.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: