29th Oct: I have offered a response to Gpuccio’s challenge below.
I think this is worth a new post.
Gpuccio has issued a challenge here and here. I have repeated the essential text below. Others may wish to try it and/or seek their own clarifications. Could be interesting. Something tells me that it is not going to end up in a clear cut result. But it may clarify the deeply confusing world of dFSCI.
Give me any number of strings of which you know for certain the origin. I will assess dFSCI in my way. If I give you a false positive, I lose. I will accept strings of a predetermined length (we can decide), so that at least the search space is fixed.
a) I would say binary strings of 500bits. Or language strings of 150 characters. Or decimal strings of 150 digits. Something like that. Even a mix of them would be fine.
No problem with that.
b) I will literally apply my procedure. If I cannot easily see any function for the string, I will not go on in the evaluation, and I will not infer design. If you, or any other, wants to submit strings whose function you know, you are free to tell me what the function is, and I will evaluate it thoroughly.
That’s OK. I will supply the function in each case. I note that when I tried to define function precisely you said that the function can be anything the observer wishes provided it is objectively defined, so, for example, “adds up to 1000” would be a function. So I don’t think that’s going to be an issue!
c) I will be cautious, and I will not infer design if I have doubts about any of the points in the procedure.
I am not happy with this. If the string meets the criteria for dFSCI you should be able to able to infer design. You can’t pick and choose when to apply it. At the very least you must prove that the string does not have dFSCI if you are going to avoid inferring design.
d) Ah, and please don’t submit strings outputted by an algorithm, unless you are ready to consider them as designed if the algorithm is more than 150 bits long. We should anyway agree, before we start, on which type of system and what time span we are testing.
I don’t understand this – a necessity system for generating digital strings can always be expressed as an algorithm e.g Fibonacci series. Otherwise it is just a copy of the string. Also it is not clear how to define how many bits long an algorithm is. Maybe it will suffice if I confine myself to algorithms that can be expressed mathematically in less than 20 symbols?
And anyway, I am afraid we have to wait next week for the test. My time is almost finished.
That’s OK. I need time to think anyway. But also I need to get your clarification on b,c and d.