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
-
N★★★
Newton's minimal resistance problem
Mathematical problem of finding a solid of revolution which experiences a minimum resistance when moving through a homogeneous fluid with constant velocity along the axis of revolution
-
I★
Immerman–Szelepcsényi theorem
Theorem
-
★★
Paradoja de Ehrenfest
-
Q★
Química matemática
Rama de la química
-
F★
Friction-maxxing
Practice of intentionally choosing less convenient options
-
★
Maximum parsimony
Optimality criterion under which the phylogenetic tree that minimizes the total number of character-state changes is to be preferred; under this criterion, the shortest possible tree that explains the data is considered best
-
P★
PSPACE-completo
Clase de complejidad
-
★
Conexionismo
Conjunto de enfoques en los ámbitos de la inteligencia artificial, psicología cognitiva, ciencia cognitiva, neurociencia y filosofía de la mente
-
C★★
Cómo plantear y resolver problemas
Libro de György Pólya
-
B★
Bloch's theorem (complex analysis)
Theorem in complex analysis named after André Bloch
-
N★
Nomothetic and idiographic
Distinct approaches to knowledge
-
P★
Problema no resuelto
-
★★★
Fundamentos de las matemáticas
Estudio de las bases conceptuales del lenguaje matemático
-
P★★
P (clase de complejidad)
Clase de complejidad computacional de problemas resolubles por una Máquina de Turing determinista en tiempo polinomial
-
C★
Completitud funcional
-
★★★
Transparencia (física)
Término del campo de la óptica
-
★
Teorema de Cook
-
★★
Plasticidad (mecánica de sólidos)
Capacidad de los materiales de deformarse permanente e irreversiblemente por encima de su límite elástico