▁equivalent ▁definitions ▁for ▁comput ability ▁relative ▁to ▁A ▁( e . g ., ▁no ▁mart ing ale ▁which ▁is ▁construct ive ▁relative ▁to ▁the ▁oracle ▁A ▁succeed s ▁on ▁B ) ▁is ▁said ▁to ▁be ▁random ▁relative ▁to ▁A . ▁Two ▁sequences , ▁while ▁themselves ▁random , ▁may ▁contain ▁very ▁similar ▁information , ▁and ▁therefore ▁neither ▁will ▁be ▁random ▁relative ▁to ▁the ▁other . ▁Any ▁time ▁there ▁is ▁a ▁T uring ▁reduction ▁from ▁one ▁sequence ▁to ▁another , ▁the ▁second ▁sequence ▁cannot ▁be ▁random ▁relative ▁to ▁the ▁first , ▁just ▁as ▁comput able ▁sequences ▁are ▁themselves ▁non random ; ▁in ▁particular , ▁this ▁means ▁that ▁Ch ait in ' s ▁ Ω ▁is ▁not ▁random ▁relative ▁to ▁the ▁hal ting ▁problem . ▁ ▁An ▁important ▁result ▁rel ating ▁to ▁relative ▁random ness ▁is ▁van ▁Lamb al gen ' s ▁theorem , ▁which ▁states ▁that ▁if ▁C ▁is ▁the ▁sequence ▁composed ▁from ▁A ▁and ▁B ▁by ▁inter le aving ▁the ▁first ▁bit ▁of ▁A , ▁the ▁first ▁bit ▁of ▁B , ▁the ▁second ▁bit ▁of ▁A , ▁the ▁second ▁bit ▁of ▁B , ▁and ▁so ▁on , ▁then ▁C ▁is ▁algorithm ically ▁random ▁if ▁and ▁only ▁if ▁A ▁is ▁algorithm ically ▁random , ▁and ▁B ▁is ▁algorithm ically ▁random ▁relative ▁to ▁A . ▁A ▁closely ▁related ▁consequence ▁is ▁that ▁if ▁A ▁and ▁B ▁are ▁both ▁random ▁themselves , ▁then ▁A ▁is ▁random ▁relative ▁to ▁B ▁if ▁and ▁only ▁if ▁B ▁is ▁random ▁relative ▁to ▁A . ▁▁ ▁Str ong er ▁than ▁Martin - L