BIT predicate
BIT predicate is a test of a specified bit in a binary number.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2562700003
- Described as
- test of a specified bit in a binary number
- Other names
- Ackermann coding
- What it is
- mathematical concept
- Wikipedias with a page
- 2
Wikidata item Q4835745 (wikidata.org/wiki/Q4835745), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1375441228
In mathematics and computer science, the BIT predicate, sometimes written BIT(i,j), is a predicate that tests whether the jth bit of the number i (starting from the least significant bit) is 1, when i is written as a binary number. Its mathematical applications include modeling the membership relation of hereditarily finite sets, and defining the adjacency relation of the Rado graph. In computer science, it is used for efficient representations of set data structures using bit vectors, in defining the private information retrieval problem from communication complexity, and in descriptive complexity theory to formulate logical descriptions of complexity classes.
From the Wikipedia article “BIT predicate” (en.wikipedia.org/wiki/BIT_predicate), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
