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
-
C
Complexidade computacional
Nº Q5157286 ★★★
Sem ofertas
-
Trivialidade (matemática)
Objetos matematicos que têm uma estrutura muito simples.
Nº Q945127 ★
Sem ofertas
-
A
Algorithmic efficiency
Amount of computational resources used by an algorithm
Nº Q1296251 ★★
Sem ofertas
-
Complexidade irredutível
Argumento usado pelos criacionistas pelo qual certos sistemas biológicos são muito complexos para terem evoluído
Nº Q988290 ★★
Sem ofertas
-
Hierarquia aritmética
Nº Q669094 ★
Sem ofertas
-
t
teorema de Sokhotski–Plemelj
Theorem
Nº Q1543149 ★
Sem ofertas
-
Idempotência
Propriedade de certas operações em matemática e ciência da computação, que podem ser aplicadas várias vezes sem alterar o resultado depois da primeira aplicação
Nº Q368988 ★★★★
Sem ofertas
-
Pseudomatemática
Nº Q3321560 ★
Sem ofertas
-
IP (complexidade)
Nº Q5973158 ★★
Sem ofertas
-
P
Principle of compositionality
Principle in linguistics about meaning
Nº Q936559 ★
Sem ofertas
-
Simplex (topologia)
Nº Q331350 ★★★
Sem ofertas
-
I
Innumeracy (book)
Book by John Allen Paulos
Nº Q3211589 ★
Sem ofertas
-
L
Lattice problem
Optimization problem in computer science
Nº Q6497128 ★
Sem ofertas
-
T
Teoria algorítmica da informação
Nº Q1757543 ★
Sem ofertas
-
M
Multiplicity (philosophy)
Philosophical assertion that there is more than one geo-historical trajectory, developed by Edmund Husserl, Henri Bergson, and Gilles Deleuze
Nº Q3860307 ★
Sem ofertas
-
Algoritmo simplex
Nº Q134164 ★★★
Sem ofertas
-
Simplex noise
Construction for n-dimensional noise functions
Nº Q7520885 ★★
Sem ofertas
-
Algoritmo A*
Algoritmo de busca em grafos para encontrar caminhos
Nº Q277680 ★★★
Sem ofertas