Skip to main content
HomeOccasional Paper 15

Irreducible Complexity and Relative Irreducible Complexity: Foundations and Applications


Jonathan Bartlett
Occas. Papers of the BSG No. 15, pp. 1-10
©2010 BSG.

 

Printable PDF of this article (281 kb)

OPBSG Home

BSG Home

Abstract
The concept of irreducible complexity is a great intuitive concept which has historically lacked a well-defined theoretical basis. This paper will show how computational theory gives an adequate account for what irreducible complexity is, what irreducible complexity’s possible biological implications are, and how irreducible complexity can be useful to molecular biologists and creation biologists.