,It is a sad fact that in our postmodern age the average citizen is no longer blessed with common sense. Westernized, atheist universities build the egos of impressionable young dolts by teaching them counter-intuitive, nonsensical ideas with which they can ‘correct’ the ‘uneducated’ and thus feel as though they are ‘elite’. The most egregious example, in my estimation, is the idea of spontaneous generation and evolution. Unfortunately, appeals to common sense no longer suffice to demonstrate the absurdity of an absurd idea, and the few of us left who possess the ability to think are left with little remedy but to appeal to more formal reasoning, just as the great Muslim intellects who invented mathematics did.
Thus it has been my task to develop a formal, mathematical proof of the impossibility of evolution that is at the same time simple enough to be understood by the layman. This proof requires little background to understand, only a bit of thought, and after evaluated will leave one immune to the waves of Western propaganda that preach the dogma of spontaneous generation. My proof is beginning to be recognized and will soon, though reluctantly, be published.
First, some definitions.
Kolmogorov Complexity: The size, in bits, of the smallest algorithm or description which yields a given sequence.
Random sequence: A sequence whose Kolmogorov Complexity is the size of the sequence itself. We can also call a random sequence an ‘incompressible sequence’.
In other words, a random sequence is random if and only if there exists no algorithm which can describe the bits in the sequence. An infinitely long sequence, however, can have very low Kolomogorov Complexity. For example, the sequence 11111111….. repeated to infinity can be described by a short algorithm which says ‘print 1, repeat’, and so, despite its infinite length, has very low K-complexity. It is thus extremely compressible. Even an irrational like pi can have extremely low K-complexity, because there are simple algorithms which can generate all of its digits.
Our proof will be by contradiction - in effect, we will assume a proposition; then by deriving a contradiction from that proposition, demonstrate the falsity of the proposition. Now, suppose x is a spontaneously generated individual. Let K(x) = Kolmogorov Complexity of x; i.e. the length in bits of the smallest algorithm which generates the sequence x. Then there exists a sequence p which describes x such that K(x) = p, i.e. p is the minimum description length of x. x was formed by random processes, so x is a random sequence and is thus incompressible. Thus K(x) = p = x.
Now we can assume that along some branch of the family tree of x a sequence of random mutations occurs which increases the complexity of x, as postulated by the theory. We can thus store this sequence of mutations, along with p, in a new sequence. Storing the entire sequence, denote it s, of mutations up to the dawn of man we thus have a randomly generated, finite sequence which is an incompressible description of man’s genetic code. Thus, because it is incompressible, s is the minimum description length of man’s genetic code. But s contains not only the algorithm for generating man’s genetic code; it also contains that for generating the code of every organism intermediate between man and the spontaneously generated individual x. Thus s is clearly longer than the length of man’s genetic code. But s is the minimum description length of man’s genetic code, so the assumption that man evolved from x yields a contradiction.
Therefore man did not evolve from a spontaneously generated organism. QED.
