Skip to content
Surf Wiki
Save to docs
general/industrial-design

From Surf Wiki (app.surf) — the open knowledge base

Simplexity


Simplexity is a neologism which proposes a possible complementary relationship between complexity and simplicity.

One of the first formally published instances of the word was in the journal 'Childhood Education' (1924), in the article it appears to be used to discuss education and psychology related issues.

Simplexity was defined by computer scientists Broder and Stolfi as: "The simplexity of a problem is the maximum inefficiency among the reluctant algorithms that solve P. An algorithm is said to be pessimal for a problem P if the best-case inefficiency of A is asymptotically equal to the simplexity of P."

In 1974 Rustum Roy and Olaf Müller noted simplexity in the structure of ternary compounds: "By dealing with approximately ten ternary structural groupings we can cover the most important structures of science and technology specific to the non-metallics world. It is a remarkable instance of nature's 'simplexity'".

In 2003 Philippe Compain in an article on the future of synthetic chemistry stated: "Simplexity may be defined as the combination of simplicity and complexity within the context of a dynamic relationship between means and ends.";

Simplexity: Why Simple Things Become Complex (and How Complex Things Can Be Made Simple) by Jeffrey Kluger details ways in which simplexity theory can be applied to multiple disciplines. Kluger offers a look at simplexity at work in economics, sports, linguistics, technology, medicine and human behavior.

Simplexity has been used by Jens Nordvig to describe the particular aim of his analytics firm Exante Data: "A research product that draws on a very complex analytical foundation, but is presented in a very simple and easy to digest manner"

References

References

  1. (Unknown). [https://books.google.com/books?id=d5vHZ2xXBa0C&q=simplexity Childhood Education] Published 1924. Association for Childhood Education International.
  2. Broder, Andrei and Jorge Stolfi. [http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=990536 "Pessimal Algorithms and Simplexity Analysis."]
  3. [[Rustum Roy]] & Olaf Müller (1974) ''The Major Ternary Structural Families'', pages 3 & 4, Springer-Verlag {{ISBN. 9780387064307
  4. Philippe Compain (2003) [http://www.lactualitechimique.org/spip.php?numero_article437 "The challenge of simplexity. The simple and the complex in organic synthesis"], [[Soci%C3%A9t%C3%A9_chimique_de_France]]
  5. Philippe Compain (2006) [https://pubs.rsc.org/en/content/articlelanding/2006/nj/b601837h/unauth "Looking forward: a glance into the future of organic chemistry"], [[New Journal of Chemistry]] 30: 823-831
  6. Kluger, Jeffrey (2008) ''Simplexity'' [https://web.archive.org/web/20080422154213/http://simplexitybook.com/ Simplexity]
  7. "Letter: Simplexity in Research". Exante Data.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Simplexity — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report