Results 261 to 270 of about 1,828,404 (296)
Some of the next articles are maybe not open access.
2012
Many bacteria have a propeller device called a flagellum on their surface that allows them to swim from one place to another. Bacterial flagella are complicated structures that have been touted by creationists as an example of “irreducible complexity” in an effort to refute evolution by natural selection.
David F. Blair, Kelly T. Hughes
openaire +1 more source
Many bacteria have a propeller device called a flagellum on their surface that allows them to swim from one place to another. Bacterial flagella are complicated structures that have been touted by creationists as an example of “irreducible complexity” in an effort to refute evolution by natural selection.
David F. Blair, Kelly T. Hughes
openaire +1 more source
Irreducible 4-Manifolds Need not be Complex
The Annals of Mathematics, 1993The authors construct smooth 4-manifolds which are homeomorphic to the Kummer surface but admit no structure of a complex or algebraic surface. This gives the first counterexamples to the so-called decomposition conjecture which states that every smooth closed simply-connected 4- manifold is diffeomorphic to a connected sum of algebraic surfaces.
Gompf, Robert E., Mrowka, Tomasz S.
openaire +1 more source
Hemostasis and irreducible complexity
Journal of Thrombosis and Haemostasis, 2003Coagulation evolved as a means to stem the loss of blood and to defend against pathogens. The complexity of the clotting cascade has been cited as evidence for the existence of divine intervention. The objective of this review is to draw on the debate between creationists and evolutionary biologists to highlight important evolutionary principles that ...
openaire +2 more sources
IRREDUCIBLE COMPLEX CHARACTERS OF THE FULL AFFINE GROUP
International Journal of Algebra and Computation, 1995In this paper we describe how the entire complex character table of the affine subgroup of the general linear group Hn can be constructed inductively. In particular a number of certain irreducible characters of Hn which were studied by Gow [5] are obtained. We also describe some irreducible characters of the affine symplectic group.
M. R. Darafsheh +2 more
openaire +2 more sources
Digital Irreducible Complexity: A Survey of Irreducible Complexity in Computer Simulations
BIO-Complexity, 2014Irreducible complexity is a concept developed by Michael Behe to describe certain biological systems. Behe claims that irreducible complexity poses a challenge to Darwinian evolution. Irreducibly complex systems, he argues, are highly unlikely to evolve because they have no direct series of selectable intermediates.
openaire +1 more source
Evolution and Irreducible Complexity
Journal of Interdisciplinary Studies, 2010The concept of inreducible complexity is central to the origins controversy. Ineducible complexity (IC) may be defined as any machine or system that requires two or more parts in order to function. Examples range from molecules to mousetraps, organelles, and organisms such as humans.
openaire +1 more source
Imprimitive, Irreducible Complex Characters of the Alternating Group
Canadian Journal of Mathematics, 1976The purpose of this paper is to list all of the characters of An, the alternating group, mentioned in the title. The same problem for the symmetric group, Sn, was dealt with by the authors in [1]. We showr here that, apart from a few exceptions, the imprimitive, irreducible complex characters of An fall naturally into two infinite families. (Throughout
Đoković, Dragomir Ž., Malzan, Jerry
openaire +2 more sources
Irreducible Complexity in Pure Mathematics
, 2008 By using ideas on complexity and randomness originally suggested by the mathematician-philosopher Gottfried Leibniz in 1686, the modern theory of algorithmic information is able to show that there can never be a "theory of everything" for all of mathematics.
exaly +3 more sources
2004
Darwinsche Evolution setzt voraus, dass der Zufall die verschiedenen Arten hervorgebracht hat. Allerdings scheint es in der Natur spezifisch komplexe Gebilde zu geben, die irrreduzibel sind, d.h. sie verlieren ihre Funktionalitat, wenn auch nur eine Komponente dieses Mechanismus fehlt.
openaire +1 more source
Darwinsche Evolution setzt voraus, dass der Zufall die verschiedenen Arten hervorgebracht hat. Allerdings scheint es in der Natur spezifisch komplexe Gebilde zu geben, die irrreduzibel sind, d.h. sie verlieren ihre Funktionalitat, wenn auch nur eine Komponente dieses Mechanismus fehlt.
openaire +1 more source
Counting Irreducible Components of Complex Algebraic Varieties
computational complexity, 2010We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs (slps). It runs in polynomial time in the Blum–Shub–Smale (BSS) model and in randomized parallel polylogarithmic time in the Turing model, both measured in the lengths and degrees of ...
Peter Bürgisser, Peter Scheiblechner
openaire +2 more sources