In a recent post, I was challenged to offer examples of computation of dFSCI for a list of 4 objects for which I had inferred design. One of the objects was a Shakespeare sonnet. My answer was the following: A Shakespeare sonnet. Alan’s comments about that are out of order. I don’t infer design because I know of Shakespeare, or because I am fascinated by the poetry (although I am). I infer design simply because this is a piece of language with perfect meaning in english (OK, ancient english). Now, a Shakespeare sonnet is about 600 characters long. That corresponds to a search space of about 3000 bits. Now, I cannot really compute the target space for language, but I … Continue reading An attempt at computing dFSCI for English language