Conversation so far:
when is a decision problem said to be polynomially reversible
The Boolean satisfiability problem is complete for the class NP of decision problems under polynomial-time reducibility.

Question: How about when a number is prime?
Self-contained rewrite: How is a decision problem used to determine a prime number?