Exact semantic classification of binary data #
The field-based classifier refines the complete exact interpretation for every descriptor. Finite classes depend on numerical zero and the normal threshold, retaining the sign of zero. Infinity signs and NaN signaling status come from the same exact interpretation.
This entry point also exports all ten predicate characterizations, real/rational threshold theorems, the finite-class partition, and canonical stored-field reconstruction.
Finite classification agrees with exact numerical zero, magnitude, and the decoded sign.
Classification is determined by the complete exact value and the declared normal threshold. The NaN sign and payload do not affect its signaling/quiet class.
Equal complete exact values have equal classes, without any IEEE-policy restriction.