A sender communicates with a receiver who wishes to reliably evaluate a fun
ction of their combined data. We show that if only the sender can transmit,
the number of bits required is a conditional entropy of a naturally define
d graph, We also determine the number of bits needed when the communicators
exchange two messages.