Current day information theory has defined randomness as being non-compressible and non-reducible. This as of yet unproven supposition, is supported by the traditionally accepted conclusions of Complexity Theory, and by the problem of Dirichlet’s Drawer or what is commonly known as the Pigeon Hole Problem.
In contrast to these potentially dated concepts, we define randomness as being an expression of subjectivity in perspectives of observation and therefore as being compressible. Additionally, we are presenting the postulate that there is sufficient information within any sequence of a few thousand bits to compress any complexity, and that there is no such thing as a non-compressible, non-reducible random sequence, or mathematical entity. We are presenting our InfinityCoilTM and BinaryAccelerationTM enabled test bench as demonstrative proof of our definition and postulate.Continue to Test Bench