BIT predicate

http://dbpedia.org/resource/BIT_predicate

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. rdf:langString
rdf:langString BIT predicate
xsd:integer 7639504
xsd:integer 1032560224
rdf:langString 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.
xsd:nonNegativeInteger 6153

data from the linked data cloud