ABSTRACT
Traditional literature on algorithmic randomness has defi ned a random sequential string as being non-reducible, not compressible, and that only a non-random sequential string is compressible and de-compressible to its original state (See Note #2). This monograph has raised salient points in reconsidering the rather rigid defi nition of randomness to include those algorithmic systems that have random compressible sequential strings.
