- random ness ), ▁but ▁stronger ▁and ▁we aker ▁forms ▁of ▁random ness ▁also ▁exist . ▁The ▁term ▁" algorithm ically ▁random " ▁used ▁to ▁refer ▁to ▁a ▁particular ▁single ▁( finite ▁or ▁infinite ) ▁sequence ▁without ▁clar ification ▁is ▁usually ▁taken ▁to ▁mean ▁" in com press ible " ▁or , ▁in ▁the ▁case ▁the ▁sequence ▁is ▁infinite ▁and ▁prefix ▁algorithm ically ▁random ▁( i . e ., ▁K - in com press ible ), ▁" Martin - L ö f - Ch ait in ▁random ". ▁▁ ▁It ▁is ▁important ▁to ▁dis ambigu ate ▁algorithm ic ▁random ness ▁with ▁st ochastic ▁random ness . ▁Un like ▁algorithm ic ▁random ness , ▁which ▁is ▁defined ▁for ▁comput able ▁( and ▁thus ▁determin istic ) ▁processes , ▁st ochastic ▁random ness ▁is ▁usually ▁said ▁to ▁be ▁a ▁property ▁of ▁a ▁sequence ▁that ▁is ▁a ▁pri ori ▁known ▁to ▁be ▁generated ▁( or ▁is ▁the ▁outcome ▁of ) ▁by ▁an ▁independent ▁ident ically ▁distributed ▁equip rob able ▁st ochastic ▁process . ▁ ▁Because ▁infinite ▁sequences ▁of ▁binary ▁digits ▁can ▁be ▁identified ▁with ▁real ▁numbers ▁in ▁the ▁unit ▁interval , ▁random ▁binary ▁sequences ▁are ▁often ▁called ▁( algorithm ically ) ▁random ▁real ▁numbers . ▁Additionally , ▁infinite ▁binary ▁sequences ▁correspond ▁to ▁characteristic ▁functions ▁of ▁sets ▁of ▁natural ▁numbers ; ▁therefore ▁those ▁sequences ▁might ▁be ▁seen ▁as ▁sets ▁of ▁natural ▁numbers . ▁ ▁The ▁class ▁of ▁all ▁Martin - L ö f ▁random ▁( binary ) ▁sequences ▁is ▁denoted ▁by ▁R AND ▁or ▁ML R .