Common · Knowledge
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.
From Wikipedia
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"
Text: Wikipédia, CC BY-SA 4.0. · Image: Quark67 (CC BY-SA 3.0) ·
Related cards
-
★
Gregory Chaitin
Argentinian mathematician and computer scientist
-
★★
Reflexivity (social theory)
In sociology of knowledge, the circular relationships between cause and effect
-
S★
Solomonoff's theory of inductive inference
Mathematical formalization of Occam's razor that, assuming the world is generated by a computer program, the most likely one is the shortest, using Bayesian inference
-
D★★
Discrepancy theory
Theory of irregularities of distribution
-
F★
Fundamental theorem of software engineering
Term in the field of software engineering
-
★
Clique problem
Computational problem of finding cliques in a graph
-
C★★
Church–Turing thesis
Thesis about the nature of computable functions
-
★★
Recursion (computer science)
Algorithmic technique in computer science of solving a problem by reducing it to a smaller instance of the same problem
-
S★★
Satisfiability modulo theories
Problem of determining whether a mathematical formula is satisfiable
-
★★★★
Synchronicity
Concept, first introduced by analytical psychologist Carl Jung, which holds that events are "meaningful coincidences"
-
T★
Thing Explainer
Book by Randall Munroe
-
★★★
Scarcity
Fundamental problem of economics where there are limited resources to fulfill society's unlimited wants
-
C★
Casorati–Weierstrass theorem
In complex analysis, the theorem that a holomorphic function arbitrarily close to any complex value in every neighborhood of an essential singularity
-
P★
Parameterized complexity
Branch of computational complexity theory
-
★★★
Economic calculation problem
Critique of central economic planning proposed by Ludwig von Mises
-
★★
Computational complexity theory
Theoretical computer science and mathematics theory that classifies problems according to their inherent difficulty, and relates those classes to each other
-
★★★★
Gravitational singularity
Location in space-time where the gravitational field of a celestial body becomes infinite
-
★★★
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time