# Correctness vs Completeness

What is the conceptual difference between the definition of correctness and completeness in verifiable cryptographic protocols? They justify that if a statement is correct then the verification should always successfully verifies. Is their any difference in the definitions? Or the one can substitute correctly the other?

It seems like authors prefer the term correctness for verifiable computations and the term completeness for zero-knowledge proofs