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
-
C★★★
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
-
★
Triviality (mathematics)
Description to what extent a mathematical statement or complication can be disregarded due to simplicity
-
A★★
Algorithmic efficiency
Amount of computational resources used by an algorithm
-
★★
Irreducible complexity
Argument by proponents of intelligent design that certain biological systems are too complex to have evolved
-
★
Arithmetical hierarchy
Hierarchy which classifies certain sets based on the complexity of formulas that define them
-
S★
Sokhotski–Plemelj theorem
Theorem
-
★★★★
Idempotence
Property of certain operations in mathematics and computer science, that can be applied multiple times without changing the result beyond the initial application
-
★
Pseudomathematics
A mathematics-like activity that does not fit into the framework of formally accepted rules
-
★★
IP (complexity)
Complexity class
-
P★
Principle of compositionality
Principle in linguistics about meaning
-
★★★
Simplex
Generalization of the notion of a triangle or tetrahedron to arbitrary dimensions
-
I★
Innumeracy (book)
Book by John Allen Paulos
-
L★
Lattice problem
Optimization problem in computer science
-
A★
Algorithmic information theory
Subfield of information theory and computer science
-
M★
Multiplicity (philosophy)
Philosophical assertion that there is more than one geo-historical trajectory, developed by Edmund Husserl, Henri Bergson, and Gilles Deleuze
-
★★★
Simplex algorithm
Algorithm
-
★★
Simplex noise
Construction for n-dimensional noise functions
-
★★★
A* search algorithm
Algorithm used for pathfinding and graph traversal