from Wiktionary, Creative Commons Attribution/Share-Alike License
- n. the degree to which something is compressible
- n. the product of pressure and molar volume divided by the product of the gas constant and the absolute temperature
from the GNU version of the Collaborative International Dictionary of English
- n. The quality of being compressible of being compressible.
from The Century Dictionary and Cyclopedia
- n. The quality of being compressible, or of yielding to pressure; the quality of being capable of compression into a smaller space or compass: as, the compressibility of elastic fluids.
from WordNet 3.0 Copyright 2006 by Princeton University. All rights reserved.
- n. the property of being able to occupy less space
Sorry, no etymologies found.
Yes, I have slightly updated my view of CSI and this issue of algorithmic compressibility is one area in which I disagree with Dembski since Langton's ant seems to produce algorithmically compressible patterns based on arbitrarily assigned initial conditions.
Solids, liquids and gases are ideal behaviours characterised by properties such as compressibility, viscosity, elasticity, strength and hardness.
This phenomenon, which airmen know as "compressibility," has thus far prevented airplanes from flying faster than sound TIME, July 3.
Because, the only other pattern that can be formulated with the same algorithmic compressibility as the pattern of 30 1s is â000000000000000000000000000000, â which can be compressed to âprint 0 X 30. â However, there are many more other patterns with the same compressibility as the first, more random pattern (assortment of 50% 1s and 50% 0s which are sorted in a truly random fashion as per the rules of statistics*).
Dembski has stated that the higher the compressibility of the pattern, the higher the specificity.
So the main thing to remember is that when measuring for specificity, measure all specified patterns of the same probability (based on what causes the patter to be specified whether function, or compressibility [average distribution], or other) against all possible patterns not specified.
CJYman: Since it is the digits average distribution which causes it to be specified, we need to measure its specificity based on its algorithmic compressibility.
Since it is the digits average distribution which causes it to be specified, we need to measure its specificity based on its algorithmic compressibility.
I've already shown the problems with your door slamming pattern under "specifications (part 2) …" The rest of your criticisms are actually my criticisms as well, since describing patterns with human language is extremely ambiguous, which is why algorithmic compressibility works so well as a non-ambiguous example.
A pattern's algorithmic compressibility can be an objective measurement and all we have to do is make sure we are comparing measurements from the same programming language (ie: print 1 X 20).
Wordnik is becoming a not-for-profit! Read our announcement here.