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
-
c
complejidad computacional
Medida de la cantidad de recursos estrictamente necesarios para ejecutar un algoritmo que resuelve un problema computacional
Nº Q5157286 ★★★
Sin ofertas
-
Trivial (matemática)
Objeto matemático que tiene una estructura muy simple
Nº Q945127 ★
Sin ofertas
-
E
Eficiencia algorítmica
Cantidad de recursos computacionales utilizados por un algoritmo
Nº Q1296251 ★★
Sin ofertas
-
Complejidad irreducible
Tesis según la cual ciertos sistemas biológicos son demasiado complejos para ser el resultado de la evolución
Nº Q988290 ★★
Sin ofertas
-
Jerarquía aritmética
Nº Q669094 ★
Sin ofertas
-
S
Sokhotski–Plemelj theorem
Theorem
Nº Q1543149 ★
Sin ofertas
-
Idempotencia
Propiedad de ciertas operaciones en matemáticas y lógica, que se pueden aplicar múltiples veces sin cambiar el resultado después de la primera aplicación
Nº Q368988 ★★★★
Sin ofertas
-
Pseudomathematics
A mathematics-like activity that does not fit into the framework of formally accepted rules
Nº Q3321560 ★
Sin ofertas
-
IP
Clase de complejidad
Nº Q5973158 ★★
Sin ofertas
-
P
Principio de composicionalidad
Nº Q936559 ★
Sin ofertas
-
Símplex
Análogo en n dimensiones de un triángulo
Nº Q331350 ★★★
Sin ofertas
-
E
El hombre anumérico
Libro de John Allen Paulos
Nº Q3211589 ★
Sin ofertas
-
L
Lattice problem
Optimization problem in computer science
Nº Q6497128 ★
Sin ofertas
-
T
Teoría algorítmica de la información
Nº Q1757543 ★
Sin ofertas
-
M
Multiplicidad (filosofía)
Nº Q3860307 ★
Sin ofertas
-
Algoritmo símplex
Método Simplex
Nº Q134164 ★★★
Sin ofertas
-
Simplex noise
Construction for n-dimensional noise functions
Nº Q7520885 ★★
Sin ofertas
-
Algoritmo de búsqueda A*
Algoritmo
Nº Q277680 ★★★
Sin ofertas