Mark C. Chu-Carroll over at Good Math Bad Math takes a philosophical position and attempts to use Godel's Theorem to prove that irreducible complexity is a meaningless concept:

No matter what you do - no matter what kind of formal system you've developed for showing that something is minimal, you're screwed. Godel just came in and threw a wrench into the works. There is absolutely no way that you can show that any system is minimal - the idea of doing it is intrinsically contradictory.

In summary: Mark thinks that Creationists need a guaranteed, perfect, 100% accurate irreducible complexity detector in order to do good science, and tries to demonstrate that there is no such beast. But Creationists don't need one. All they need is a detector that works

*at least once.*

The Creationist concept of irreducible complexity (IC) as proof against evolution is irredeemably flawed. There is no shortage of websites that demonstrate the feebleness of IC as an anti-evolution argument, so I'll limit myself to a single point:

- The IC argument is an argument from ignorance.

Mark sets his sights very high: he wants a knock-out blow, proof that not only can there be no examples of IC, but that the very concept is meaningless. Shorn of its mathematics, it can be summed up thusly:

- Proving that a biological system is irreducibly complex is mathematically equivalent to proving that it is minimal in the number-theoretic sense;
- Godel's Theorem holds for that biological system;
- Therefore proving that some biological system is minimal is impossible;
- Therefore we can't ever prove that a system is irreducibly complex;
- And therefore the concept of IC is scientifically meaningless.

Unfortunately, Mark gives no evidence for his very first premise. The concept of minimality in the number-theoretic sense has a specific meaning, and it isn't clear at all that irreducible complexity is equivalent to that specific meaning (mostly because it isn't clear what IC actually is). But, for the sake of the argument, let's assume point (1) is correct.

Point (2) is even more problematic. Mark has fallen for the error of greedy reductionism. Reductionism is a powerful tool, in biology no less than any science. But like all tools, it can be misused, and greedy reductionism is such an error: Mark ignores developmental biology, and consequently imagines that there must be a 1:1 correspondence between the genotype of an organism (the DNA) and its phenotype (the actual organs and molecular protein machines). Because DNA is Turing Complete, he imagines that Godel's Theorems must also apply to higher-order biological features -- the sorts of molecular machinery, the lipids and proteins and enzymes, that we must look at when trying to find irreducible complexity.

In a reply to a comment, he writes:

But per Godel, no axiomatic system is complete and consistent. If you have an incomplete axiomatic system, then the axiomatic system isn't powerful enough to do minimality proofs. If the axiomatic system is powerful enough to do minimality proofs (i.e., it's complete), then it's by definition inconsistent.

But this is just not so. Mark skips over a requirement for Godel's Theorems to hold. The most important is that the axiomatic system be computably enumerable, that is, there must be a way to enumerate all the statements ("true or false theories") of that system.

Are biological systems computably enumerate? Genes are comfortably digital, and thus any finite number of genes will be computably enumerate. A gene is a gene is a gene, regardless of the organism. But a gene's phenotype, it's effect, is not necessarily digital, it is often analog, and that means continuous rather than discrete.

If we look for irreducible complexity, we won't be looking for it in the genotype of the organism's DNA, we'll be looking in the phenotype: in the proteins, lipids and enzymes in 3D space, and the interactions between them. It is not at all clear that phenotypes are computably enumerate, even at the molecular level. At the very least, since molecules exist in a three dimensional continuum space, there is an uncountably infinite number of statements we could make about the relative positions of any two atoms. Adding the axioms of chemistry -- or physics -- will not help him, since we are rapidly getting into areas where we don't know enough to enumerate those axioms, let alone all the possible true and false statements that follow from them. (Given the laws of quantum mechanics, derive the solubility in water of all possible molecules containing 100 carbon atoms. Quickly now, we don't have all day.)

Mark's argument falls down badly at point (3). He writes:

This is a result of some work done by Greg Chaitin in Algorithmic Complexity Theory. A fairly nifty version of this can be found on Greg's page.

The fundamental result is: given a system S, you cannot in general show that there is no smaller/simpler system that performs the same task as S.

But Mark has missed an important part of what Chaitin says, and that makes a vast difference to his conclusion. Chaitin writes:

The first of these theorems states that anN-bit formal axiomatic system cannot enable one to exhibit any specific object with program-size complexity greater thanN + c.

and furthermore, writes here:

Show that a formal system of lisp complexity H_lisp (FAS) = N cannot enable us to exhibit an elegant S-expression of size greater than N + 410. An elegant lisp expression is one with the property that no smaller S-expression has the same value. Setting: formal axiomatic system is never-ending lisp expression that displays elegant S-expressions.

What Chaitin has demonstrated is this:

Given a formal axiomatic system of some given amount of complexity, there exists sufficiently more complex systems within our formal system which we cannot prove if they are minimal or not.

For the programming language Lisp, Chaitin claims to have proven that "sufficiently more complex" means a mere 410 bytes over and above the complexity of Lisp itself. For DNA, we have no idea what sufficiently more complex may be; for the phenotype of even a simple organism, we can't even begin to guess. Hypothetically, it could be billions upon billions of gigabytes. Mark merely assumes that, since there are sufficiently large systems which can't be proven minimal, no systems can be proven minimal.

*Since there are animals, like elephants, which are too big for me to lift, all animals must be too big for me to lift.*

Or, to put it another way, Mark's argument is this:

*There are hypothetical biological systems so complex that we can't prove, in the mathematical sense, that they are irreducibly complex; therefore the entire concept of irreducible complexity is meaningless.*

When you strip out all the mathematics and formal language, the error is obvious. What about simpler biological systems? Can we not prove they are minimal? Maybe not -- but Mark hasn't ruled them out, and so his entire argument against IC is shot down in flames.

Interestingly, Mark himself recognises the existence of this hole in his argument, but just waves his hands and hopes it will go away. In this reply to a comment, he says:

If you look at the proof, there is a critical threshold, based on the size of the formal axiomatic system (FAS) that proves minimality. The problem with minimality kicks in as soon as the complexity of the system becomes such that the length of the meta-program plus the size of the FAS is smaller than the information-theoretic complexity of the system.

Tiny systems - like a single-instruction program - areprobablysmaller than that threshold. (I'll explain the probably bit in a moment.) Butwe can't knowwhere that threshold is: because finding the threshold requires finding the minimum size of a FAS that can be used to show mimimality. And that's the minimality problem biting itself.

(Emphasis in original.)

Talk about Bad Math! Mark's argument, then, is effectively:

- For all X < N, where N is some unknown but positive non-zero number, IC is undecidable.
- Therefore IC is undecidable for all X.

Hmmm.

But it gets worse for Mark. He states that we can't know where that threshold is, and even emphasises it -- but if you read Chaitin's page that Mark linked to, you will see Chaitin has written:

As is shown in this course, the algorithms considered in the proofs of these two theorems are now easy to program and run, and by looking at the size in bits of these programs one can actually, for the first time, determine exact values for the constantscandc'.

Chaitin says he can calculate the threshold, and does. This wasn't hidden deep within a 300 page tome; it was the fifth paragraph, and Mark apparently missed -- or ignored -- it.

So far Mark's argument is not looking healthy: the first four points out of his five are either unproven, unjustified or wrong. The fifth point, his final conclusion, is even more flawed. He's confused undecidability for meaninglessness. Chaitin tells us that, given a sufficiently large system, we can't prove whether it is minimal or not; from this, Mark argues that therefore the very concept of being minimal is nonsense. He writes, replying to a comment:

The fact remains thatno test can ever demonstrate that a real system is IC.A scientistcan'ttest to see if a hypothesis of IC holds up. It's a non-testable hypothesis, becausethe underlying concept is invalid.

(Italics in original -- bold added.)

Mark hasn't demonstrated that IC is invalid. All he has shown is that

**some**examples of IC are unprovable, not that there are no provable examples at all.

Mark falls for the fallacy of assuming that just because a statement of a formal system is unprovable, it must be invalid. But that's nonsense: unprovable (or undecidable) doesn't mean false, or meaningless. To take an non-mathematical example, it is undecidable whether Alexander the Great's maternal grand-mother ate a bowl of fried potato chips on her 10th birthday; but it is certainly either true or false that she did. That logical undecidability doesn't prevent us making a probabilistic decision that, beyond all reasonable doubt, she did not: potatoes weren't introduced into Europe (as far as we know) until over a thousand years later.

A more mathematical example of an undecidable statement is Goodstein's Theorem.

Despite all the holes in Mark's reasoning, let's grant him his conclusion: IC is logically undecidable. What does this mean for the science of biology?

Very little. All it means is that IC is unprovable in the mathematical sense, not unprovable in the scientific sense.

Science has much lower standards than mathematics: proof beyond all reasonable doubt, not beyond all doubt. All truths are provisional in science. In mathematics, we can be absolutely 100% certain that (e.g.) 11 is a prime number -- but in science, the best we can say about any fact is that it is true to the best of our knowledge, subject to revision in the light of new facts.

That "best" might be very good indeed. You can bet your life on many things in science, but it is never 100% certain. Scientists sometimes produce formal proofs based on simplified models of whatever feature they are interested in, but the model is not reality. Mathematical models are always simpler than reality. Consequently, science is ultimately based on

**empirical evidence**. And what empirical evidence can prove, better empirical evidence can disprove.

(The classic example is Newtonian and Relativistic Mechanics; astronomical observations of the planets were Newtonian physics' greatest triumph -- until more accurate observations discovered discrepancies which couldn't be successfully explained by Newtonian physics.)

It is unfair to hold Creationists to greater standards than we hold real scientists doing science. Let's accept, for the sake of the argument, that Mark is correct: we can't find absolute certain mathematical proof that a specific biological system is minimal and therefore IC. Fine; but that's irrelevant to the question of whether we can be provisionally sure that it is minimal. On the basis of empirical research, Fermat's Last Theorem was proven beyond all reasonable doubt many years before certain mathematical proof was discovered. Mathematicians don't care for empirical evidence, but that's the fundamental core of science.

Let's pretend, for the sake of the argument, that Creationists like Behe who work with IC are doing real science. (Try not to laugh too hard.) They are working in a research program aimed at collecting enough evidence to disprove the fact of evolution (except our hypothetical Creationist scientists will disagree that it is a fact). To do so, they aim to prove that some sufficiently large number of biological features are irreducibly complex. For them, one such IC system is sufficiently large; for Richard Dawkins, it may require hundreds of examples before he'll admit that evolution can not explain all the facts of the biological world.

If the Creationists are lucky, they will find some examples of IC that are simple enough that they can formally prove they are minimal, and we are done. Mark's argument is shot down in flames, and biologists start looking for a new paradigm to explain the features of the biological world.

If the Creationists aren't so lucky, they will find biological features that they think are IC, but can't formally prove that they are absolutely minimal. Will that matter? No, of course not, any more than biologists let the fact that they don't have a formal axiomatic system for the mechanics of predation prevent them from accepting as true the empirical rule that, in general, predators will catch more slow, weak prey and fewer fast, strong prey. Biologists will try to falsify the IC hypothesis. If there are enough failures (whatever "enough" means), biologists will become convinced that, on the balance of the evidence, that these are actual IC systems. The lack of formal proof will disturb them no more than the lack of formal proof that the sun is mostly made of hydrogen disturbs physicists. Empirical evidence is enough.

In conclusion, Mark has:

- Assumed that Godel's Theorem's apply to biological phenotypes, an unjustified assumption;
- Tried, but failed, to demonstrate that Godel's Theorems forbid us from proving the existence of irreducibly complex features; and
- Failed to demonstrate that it would matter even if proof of IC was impossible.

There are many reasons to consider irreducible complexity to be a degenerate research program, but Godel's Theorems are not one of them.

## No comments:

Post a Comment