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.
Nº Q7520891 ★
Común · Saberes
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.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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"
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Quark67 (CC BY-SA 3.0) ·
Cartas cercanas
-
Gregory Chaitin
Matemático y informático estadounidense
Nº Q930837 ★
Sin ofertas
-
Reflexividad (teoría social)
Nº Q2747831 ★★
Sin ofertas
-
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
Nº Q14947941 ★
Sin ofertas
-
D
Discrepancy theory
Theory of irregularities of distribution
Nº Q1228843 ★★
Sin ofertas
-
F
Fundamental theorem of software engineering
Term in the field of software engineering
Nº Q5508974 ★
Sin ofertas
-
Problema del clique
Nº Q1196873 ★
Sin ofertas
-
T
Tesis de Church-Turing
Nº Q309157 ★★
Sin ofertas
-
Recursión (ciencias de computación)
Método en ciencias de computación
Nº Q264164 ★★
Sin ofertas
-
T
Teorías de satisfacibilidad módulo
Nº Q2067766 ★★
Sin ofertas
-
Sincronicidad
Concepto desarrollado por Carl Gustav Jung para definir eventos vinculados no por una relación causal, sino por una relación de significado
Nº Q1121101 ★★★★
Sin ofertas
-
T
Thing Explainer
Book by Randall Munroe
Nº Q60740291 ★
Sin ofertas
-
Escasez
Falta de recursos y la valorarizacion de los mismos
Nº Q815758 ★★★
Sin ofertas
-
T
Teorema de Weierstrass-Casorati
Teorema matemático
Nº Q2226962 ★
Sin ofertas
-
C
Complejidad parametrizada
Nº Q1570441 ★
Sin ofertas
-
Cálculo económico
Crítica a la economía planificada socialista
Nº Q1629575 ★★★
Sin ofertas
-
Teoría de la complejidad computacional
Nº Q205084 ★★
Sin ofertas
-
Singularidad gravitacional
Zona del espacio-tiempo donde no se puede definir ninguna magnitud física relacionada con los campos gravitatorios
Nº Q201721 ★★★★
Sin ofertas
-
NP (clase de complejidad)
Clase de complejidad computacional
Nº Q628036 ★★★
Sin ofertas