Uncommon Descent Serving The Intelligent Design Community

The MathGrrl files: Reestablishing what we know

Share
Facebook
Twitter
LinkedIn
Flipboard
Print
Email

MathGrrl’s friends have been discussing her recent post( here), on measuring complex specified information, which garnered 324 comments and counting.*

Not being a mathie, I couldn’t follow most of the discussion here, but certain turns in the discussion reminded me of something I’d heard before:

If design is a part of nature, then the design is embedded in life as information. But many people are not used to thinking in terms of an immaterial quantity like information. As G.C. Williams writes: “Information doesn’t have mass or charge or length in millimeters. Likewise, matter doesn’t have bytes. You can’t measure so much gold in so many bytes. It doesn’t have redundancy, or fidelity, or any of the other descriptors we apply to information. This dearth of shared descriptors makes matter and information two separate domains of existence, which have to be discussed separately, in their own terms.”- quoted in By Design or by Chance?. P. 234.

The reason the materialist doesn’t see how information can’t just “appear” is that materialism, which undergirds everything else he believes, never took information into account. So he can treat it as magic, as something that “just happens.”

Meanwhile, perhaps junior ID theorists cannot formulate a single definition of complex specified information at present. But it really wouldn’t matter if they could. The materialist would just blink and say, “I’m sorry. This is so confusing.”

I’ve been through this with enough different issues to know that that would be the outcome, for sure.

So, for ID theorists, the goal is not convincing such people or reaching an impasse with them, but formulating definitions that actually lead to new discoveries or clearer understanding of current ones.

A similar thing happened in Isaac Newton’s day, when Newton’s equations for gravity were rejected because they involved action at a distance. And that wasn’t allowed. His “laws” were accepted anyway by working scientists and engineers because they enabled accurate calculations. There is no other way it could have happened.
* And counting: Our practice is to close comments after thirty days, so there’s still time to make a contribution.

Next week, I hope to present an interview with Jonathan Wells on junk DNA.

Comments
My thanks to everyone for what has been a fascinating discussion. To Joseph @ 68... I'm not a computer scientist, but wouldn't a Turing Machine count as a mathematically rigorous definition of a computer programme? I understand Dr. Hava Siegelmann of Technion claims to have found an even more powerful and mathematically rigorous class of computing machines. Googling for "evidence gene duplication" also turns up may interesting results. None of that of course rules out Intelligent Design as a concept.idcurious
April 1, 2011
April
04
Apr
1
01
2011
04:19 AM
4
04
19
AM
PDT
Jemima, No I cannot. I would refer you to VJTorley's most recent thread, though.Collin
March 29, 2011
March
03
Mar
29
29
2011
08:10 AM
8
08
10
AM
PDT
Still waiting for evidence for gene duplicaions and the origin of life. And we are till waiting for tht mathemaically rigorous definition for a computer program. Geez you would think that the evos drooling over CSI would step up instead of avoiding the issues.Joseph
March 29, 2011
March
03
Mar
29
29
2011
04:03 AM
4
04
03
AM
PDT
blipey the clown:
Then what’s with all the homophobia and threats of violence against of all things a clown?
It's all your twisted imagination.
You are not scared of clowns are you?
Erik you are the one sending me emails.Joseph
March 29, 2011
March
03
Mar
29
29
2011
04:01 AM
4
04
01
AM
PDT
Collin
If that information is all specified, then it is CSI and an indicator of design.
More or less. However that calculation now needs to be performed for the examples given (Josephs objections notwithstanding) on the other thread. Can you? Can Joseph?JemimaRacktouey
March 29, 2011
March
03
Mar
29
29
2011
01:10 AM
1
01
10
AM
PDT
Joseph
And my daughter’s god-father is homosexual.
Then what's with all the homophobia and threats of violence against of all things a clown? You are not scared of clowns are you?JemimaRacktouey
March 29, 2011
March
03
Mar
29
29
2011
01:07 AM
1
01
07
AM
PDT
Collin- that is it. 500 bits of si is the upb. but I doubt the limit needs to be that high.Joseph
March 28, 2011
March
03
Mar
28
28
2011
03:59 PM
3
03
59
PM
PDT
So let me guess- JemimaRacktouey is either blipey the clown or oldmanintheskydidit/ OM. My guess is the sockpuppet has been banned from here and has come back to incite hostilities. My apologies for taking the bait even though I knew it was fishing.Joseph
March 28, 2011
March
03
Mar
28
28
2011
03:49 PM
3
03
49
PM
PDT
JR- There isn't anything in your Dembski quote-mine that contradicts what I posted about CSI. And my daughter's god-father is homosexual. But thanks for stooping to new lows to try to stop your opponents.Joseph
March 28, 2011
March
03
Mar
28
28
2011
03:46 PM
3
03
46
PM
PDT
Maybe I'm finally starting to get it. Somebody tell me if I'm wrong. Specificity can be present in any information even if its only 1 or 2 bits. But complexity is defined by Dembski as at least having 500 bits of information. If that information is all specified, then it is CSI and an indicator of design. Is this an accurate portrayal of the idea?Collin
March 28, 2011
March
03
Mar
28
28
2011
02:53 PM
2
02
53
PM
PDT
Moderators, I followed the link on the poster's name for "Joseph" to his blog and found the following comment he left:
Why are you in such a rush to have your boyfriend hospitalized?
I'm surprised you'll allow a link on every post of his on this site to a blog containing such homophobic threats! But your moderation policies are not mine to question so I defer to whatever your standard policy is on such issues.JemimaRacktouey
March 28, 2011
March
03
Mar
28
28
2011
02:51 PM
2
02
51
PM
PDT
Well, it seems like the complexity part is defined by bits but the specificity is not.Collin
March 28, 2011
March
03
Mar
28
28
2011
02:47 PM
2
02
47
PM
PDT
Joseph,
CSI is a yes or no thing- either it is present or it isn’t.
And
Also, as I said in that long thread, CSI is a yes or no thing- either it is present or it isn’t.
Yet to the best of my knowledge that's simply not true. For example Dr Dembski said:
If we now define CSI as any specified information whose complexity exceeds 500 bits of information, it follows immediately that chance cannot generate CSI. Henceforth we take the "C" in "CSI" to denote at least 500 bits of information.
Do you accept you are wrong in your claim?JemimaRacktouey
March 28, 2011
March
03
Mar
28
28
2011
02:29 PM
2
02
29
PM
PDT
So now pointing out the obvious is now "hostility"? Dealing with weasels is rather tiresome yet here we are.Joseph
March 28, 2011
March
03
Mar
28
28
2011
01:57 PM
1
01
57
PM
PDT
You know. Joseph, your continued hostility towards just about everyone is rather tiresome.jon specter
March 28, 2011
March
03
Mar
28
28
2011
01:54 PM
1
01
54
PM
PDT
Yes it is and either it is present or it isn't. So how many bits in those digital organisms MG is talking about? I take you haven't read "No Free Lunch" either.Joseph
March 28, 2011
March
03
Mar
28
28
2011
01:46 PM
1
01
46
PM
PDT
Also, as I said in that long thread, CSI is a yes or no thing- either it is present or it isn’t.
I thought it was measured as a number of bits?jon specter
March 28, 2011
March
03
Mar
28
28
2011
01:02 PM
1
01
02
PM
PDT
MathGrrl:
You didn’t provide any reasons that are supported by any of Dembski’s books or papers on CSI, you simply declared my scenarios “bogus” out of hand.
CSI pertains to origins and your quote-mine doesn't change that fact. And you still haven't read "No Free Lunch" so I say you don't have anything to say about CSI. BTW I am sill waiting for that matmatically rigorous definition of a computer program. You seem to be avoiding that at all costs. I say that is because it exposes your srawman.Joseph
March 28, 2011
March
03
Mar
28
28
2011
12:43 PM
12
12
43
PM
PDT
MahGrrl:
I am asking for the CSI in the bit strings that represent the genomes of the digital organisms.
How my bits are the for each digital organism? Also, as I said in that long thread, CSI is a yes or no thing- either it is present or it isn't. If it is then that indicates design.Joseph
March 28, 2011
March
03
Mar
28
28
2011
12:39 PM
12
12
39
PM
PDT
PaV,
MathGrrl’s request was not only unreasonable, but unachievable in the case of one, and likely in all four cases. That is, CSI, as defined in NFL, does not exist in the ev program; so how does one define what does not exist?
You're still confusing the simulator with what is being simulated. I am asking for the CSI in the bit strings that represent the genomes of the digital organisms.
MathGrrl set up an impossible scenario: she asks for a CSI calculation for these programs, and then INSISTS, and I mean INSISTS, that it be based on Dembski’s “Specification” paper. Well, there’s this little bitty problem: Dembski, in his “Specification” paper, no longer talks about CSI, but, instead, “specified complexity”, and he also talks about “semiotic agents” and such.
If my understanding is correct, specified complexity beyond a certain number of bits constitutes CSI, according to Dembski.
I’ve maintained all along that MathGrrl’s demand is excessive. The proof of that is that she has failed to provide anything like it.
I'm asking for clarification of a core ID concept. Why would it be incumbent on me to provide "anything like it"? ID proponents make very strong claims that depend on CSI being an objective metric. It is not "excessive" to request a rigorous mathematical defintion of that metric and some detailed examples of how to calculate it.MathGrrl
March 28, 2011
March
03
Mar
28
28
2011
12:08 PM
12
12
08
PM
PDT
Joseph,
For example, the next time somebody makes a claim involving CSI I’ve learned that I can simply link them to that thread and ask them if they can apply their claimed knowledge of CSI to the examples in the OP.
The examples in the OP are bogus for the reasons provided in that thread.
You didn't provide any reasons that are supported by any of Dembski's books or papers on CSI, you simply declared my scenarios "bogus" out of hand.MathGrrl
March 28, 2011
March
03
Mar
28
28
2011
12:07 PM
12
12
07
PM
PDT
Mrs. O'Leary, I'm unexpectedly off the net for a weekend and come back to find yet another thread with my name in it! You're quite good for my ego. I would like to clarify one point you raised, though:
Meanwhile, perhaps junior ID theorists cannot formulate a single definition of complex specified information at present. But it really wouldn’t matter if they could. The materialist would just blink and say, “I’m sorry. This is so confusing.” I’ve been through this with enough different issues to know that that would be the outcome, for sure.
I firmly agree that some ID opponents would respond exactly that way, just as some ID proponents dismiss empirical evidence that doesn't support their views. We're all humans here, and we don't always respond rationally. That being said, I'm an optimist on most days so I think that there will be enough people of good faith and good nature to fairly evaluate all the evidence. You put your finger on a way to contribute to that:
So, for ID theorists, the goal is not convincing such people or reaching an impasse with them, but formulating definitions that actually lead to new discoveries or clearer understanding of current ones.
This is exactly what I hoped would happen in the CSI thread, but we're near 400 comments without any resolution. If anyone in this thread can help out, please join us in that one.MathGrrl
March 28, 2011
March
03
Mar
28
28
2011
12:06 PM
12
12
06
PM
PDT
PaV @ 60. That all seems non-straight forward.
But, bottom-line, if anyone wanted to check for “specified complexity”, the easiest way to check would be to check for CSI. If you find CSI, then you could move on to check for SC.
Once you've found CSI how exactly do you "check for SC"? Could you give an example of such? It's not clear to me how that would be applied in a real scenario.JemimaRacktouey
March 28, 2011
March
03
Mar
28
28
2011
11:01 AM
11
11
01
AM
PDT
So chi is in "bits" or a "number"?utidjian
March 28, 2011
March
03
Mar
28
28
2011
10:53 AM
10
10
53
AM
PDT
utidijian: PS: The term ? (chi) also appears multiple times in the paper and in the glossary of terms on this site and identifies it as the metric for CSI. There are several, you might say, "co-factors" that have been added to the original CSI equation, and I think chi is part of the reformulation. CSI and "specified complexity" are intimately related, but not the same. But, bottom-line, if anyone wanted to check for "specified complexity", the easiest way to check would be to check for CSI. If you find CSI, then you could move on to check for SC.PaV
March 28, 2011
March
03
Mar
28
28
2011
10:00 AM
10
10
00
AM
PDT
utdifian: Isn’t the term “Specified Complexity”(SC) interchangeable with the term “Complex Specified Information”(CSI)? Not really. CSI is given in "bits". Specified complexity is a "number".PaV
March 28, 2011
March
03
Mar
28
28
2011
09:55 AM
9
09
55
AM
PDT
Quiet ID [43]: Nobody can read this discussion and conclude that there’s any settled understanding of CSI or specification in ID theory. It’s the Keystone Kops around here. Well, I think this is principally due to several reasons: (1) MathGrrl's request was not only unreasonable, but unachievable in the case of one, and likely in all four cases. That is, CSI, as defined in NFL, does not exist in the ev program; so how does one define what does not exist? (2) MathGrrl set up an impossible scenario: she asks for a CSI calculation for these programs, and then INSISTS, and I mean INSISTS, that it be based on Dembski's "Specification" paper. Well, there's this little bitty problem: Dembski, in his "Specification" paper, no longer talks about CSI, but, instead, "specified complexity", and he also talks about "semiotic agents" and such. What happened was that she was being given proper answers from Dembski's paper by a number of people here at UD, but she didn't seem to understand the answers, and questions, given her. (Or else, she simply refused to answer the questions.) (3) For my part, I'm more familiar with CSI as Dembski presents it in NFL since I went through and digested it a couple of years ago. But it's been six years since I read the "Specification" paper, and I wasn't sure where that sat anymore. But, because of this putative "discussion", I've had to reread it. While profitable, it has been an expenditure of time and energy foisted upon me simply in an effort to try and understand what MathGrrl was trying to get at. However, now have reread most of the paper, I now see that Dembski has reformulated CSI because of some of the (trivial) criticisms leveled against it over the years. Because of the added rigor needed to refute the rather trivial criticisms directed at CSI, Dembski chose to reformulate it mathematically, and now calls it "specified complexity". In the Addendum to the paper, you can read where and how CSI and "specified complexity" match up. The net effect of these trivial criticisms is that mathematically things have become even a little harder to grasp, and CERTAINLY, would require more time and effort (simply because terms have been introduced into the equation that need to be determined), to DEVELOP a "rigorous mathematical definition" for the indicated scenarios. This would involve serious time, effort and work. Now why should we, here at UD, do this hard labor for MathGrrl. Let her do the work. My advice to MathGrrl is that she reread both NFL and the "Specification" paper until she fully understands it, and then tackle one of the remaining three programs she's listed. I say three, because, patently, the ev program does not produce CSI, or, if you will, "specified complexity". My further advice to her is: don't waste your time, because you're not going to be able to prove that either CSI---as defined in NFL---or "specified complexity"---as defined and developed in "Specification". As to saying that there is no "settled understanding of CSI or specification", this appears so because NFL is different from the "Specification" paper. The simpler concept is CSI. So MathGrrl should stick to NFL and try and prove that CSI, as defined by NFL, exists in one of those programs. That ought to keep her busy for a while. If there is no other point you take away from all of this, please understand that a specification and a chance hypothesis is DIFFERENT for every instance of supposed CSI ("specified complexity"). Notice she gave four instances. Why? Because they are different for each one---while the definition of CSI always remains the SAME! There are criteria that have to be met in all valid instances of CSI/specified complexity: these stay the same and form the "DEFINITION" of CSI. What the actual pattern is varies. What the actual chance hypothesis corresponding to the appearance of the 'pattern' also varies, etc., etc. One final point: I've maintained all along that MathGrrl's demand is excessive. The proof of that is that she has failed to provide anything like it. The hard work is in developing the chance hypothesis. She's failed to do this. And she hasn't told us WHY she's failed to do this. And, of course, her "specifications" are in error, or so they seem to me. Maybe she would like to begin by explaining WHY she thinks they represent the specifications inherent in the programs.PaV
March 28, 2011
March
03
Mar
28
28
2011
09:53 AM
9
09
53
AM
PDT
PS: The term ? (chi) also appears multiple times in the paper and in the glossary of terms on this site and identifies it as the metric for CSI.utidjian
March 28, 2011
March
03
Mar
28
28
2011
09:27 AM
9
09
27
AM
PDT
PaV @ 55: You say:
"So I didn’t notice at first, but it turns out that you won’t find the letters CSI anywhere in that paper."
Which is correct... but... the paper does mention "Specified Complexity" many times and even has a section with that as the tile. Isn't the term "Specified Complexity"(SC) interchangeable with the term "Complex Specified Information"(CSI)?utidjian
March 28, 2011
March
03
Mar
28
28
2011
08:44 AM
8
08
44
AM
PDT
Collin: Calculating CSI in some instances is fairly easy to do. Calculating it for other instances is very difficult although possible in principle. Mathgrrl’s examples are an example of the latter and no one here is willing to go through the immense amount of work to do it. That does not mean that it’s not possible. That's correct. One has to identify the pattern associated with an event. And there is then a chance hypothesis that is associated with the pattern. Once all of that is established, then the math is easy. In the case of Schneider's ev program, the "pattern" is not what MathGrrl claims it to be. The specification should be along the lines of: "a binary representation of an enzymatic binding site that is 16 nucleotides long". Rather than go through the mumbo jumbo of establishing the chance hypothesis---which then entails looking through the computer program and fitness functions and such---I simply noted the binary length, which is equal, roughly, to 260 bits. But CSI, as defined in NFL, must contain at least 500 bits of information as defined there (which is a simple enough calculation). Thus, the output of the ev program, on the face of it, does not rise to the level of CSI. AND, MathGrrl should have understood that! So, bottom line, it is impossible to write a "rigorous mathematical definition" of CSI for the "specification" that actually exists in the program. MathGrrl, incorrectly wrote: "“A nucleotide that binds to exactly N sites within the genome.” Well, if this were the true "specification" of the ev program, then if N > 50 (there's 10 binary digits per nucleotide in the program), then it could, conceivably become CSI. But we know N = 16. So why did MathGrrl provide an erroneous "specification"? Was she up to something? Further, since I read Dembski's "Specification" paper six years ago, and his NFL two-and-half years ago, I'm more familiar with NFL than the Specification paper. So I didn't notice at first, but it turns out that you won't find the letters CSI anywhere in that paper. So, then, how is it that MathGrrl asks for a "rigorous mathematical defintion" of CSI based on the paper? Is she just ignorant of the differences? Is she playing games? Does she not care to wrestle with Dembski writes there so she looks for someone else to do it for her? I'm a little amazed, actually.PaV
March 28, 2011
March
03
Mar
28
28
2011
08:15 AM
8
08
15
AM
PDT
1 2 3

Leave a Reply