Access control is provided over increasingly smaller data sets,
perhaps down to the bit level. Examples include database field-based access
controls, record-by-record controls, and multi-level secure markings of
portions of documents.
Complexity: In general, determining accessibility of
data analyzed by Turing capable programs is an NP-complete problem,
[Denning82] and in some cases it may be undecidable.