In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(i, j), is a predicate that tests whether the jth bit of the number i is 1, when i is written in binary.
In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(i, j), is a predicate that tests whether the jth bit of the number i is 1, when i is written in binary. (en)
In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(i, j), is a predicate that tests whether the jth bit of the number i is 1, when i is written in binary. (en)