L&FP, 69: A way to understand Functionally Specific Complex Organisation and/or associated Information [FSCO/I] i/l/o Kolmogorov-Chaitin Complexity
It seems that it is exceedingly hard for some to understand what FSCO/I is about. In responding to an objector, I wrote as follows just now, and think it is worth headlining for reference: Where, K-Complexity is summarised by Wikipedia, as a first level point of reference that would have been immediately accessible all along: <<In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size Read More ›