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 ★
Comum · 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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em 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: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Quark67 (CC BY-SA 3.0) ·
Cartas próximas
-
Gregory Chaitin
Nº Q930837 ★
Sem ofertas
-
reflexividade
In sociology of knowledge, the circular relationships between cause and effect
Nº Q2747831 ★★
Sem ofertas
-
T
Teoria da Inferência Indutiva de Solomonoff
Nº Q14947941 ★
Sem ofertas
-
D
Discrepancy theory
Theory of irregularities of distribution
Nº Q1228843 ★★
Sem ofertas
-
T
Teorema fundamental da engenharia de software
Term in the field of software engineering
Nº Q5508974 ★
Sem ofertas
-
Problema do clique
Nº Q1196873 ★
Sem ofertas
-
T
Tese de Church-Turing
Nº Q309157 ★★
Sem ofertas
-
Recursividade (ciência da computação)
Nº Q264164 ★★
Sem ofertas
-
S
Satisfiability modulo theories
Problem of determining whether a mathematical formula is satisfiable
Nº Q2067766 ★★
Sem ofertas
-
Sincronicidade
Conceito desenvolvido por Carl Gustav Jung para definir acontecimentos que se relacionam não por relação causal e sim por relação de significado
Nº Q1121101 ★★★★
Sem ofertas
-
T
Thing Explainer
Book by Randall Munroe
Nº Q60740291 ★
Sem ofertas
-
Escassez
Problema fundamental da economia, em que há recursos limitados para satisfazer os desejos ilimitados da sociedade
Nº Q815758 ★★★
Sem ofertas
-
t
teorema de Casorati–Weierstrass
In complex analysis, the theorem that a holomorphic function arbitrarily close to any complex value in every neighborhood of an essential singularity
Nº Q2226962 ★
Sem ofertas
-
C
Complexidade parametrizada
Nº Q1570441 ★
Sem ofertas
-
Problema do cálculo econômico
Obstáculo para a eficiência econômica em sistemas de planejamento central
Nº Q1629575 ★★★
Sem ofertas
-
Teoria da complexidade computacional
Nº Q205084 ★★
Sem ofertas
-
Singularidade gravitacional
Nº Q201721 ★★★★
Sem ofertas
-
NP (complexidade)
Nº Q628036 ★★★
Sem ofertas