In database systems, a consistent transaction is one that does not violate any integrity constraints during its execution. If a transaction leaves the database in an illegal state, it is aborted and an error is reported.
In algorithms, the notion of completeness refers to the ability of the algorithm to find a solution if one exists, and if not, reports that no solution is possible.
In computational complexity theory, a problem P is complete for a complexity class C, under a given type of reduction, if P is in C, and every problem in C reduces to P using that reduction. For example, each problem in the class NP-complete is complete for the class NP, under polynomial-time, many-one reduction.
In software testing, completeness has for goal the functional verification of call graph (between software item) and control graph (inside each software item).
The concept of completeness is found in knowledge base theory.
You could go on and on with such definitions... maybe make the question less vague?
And if I had a bad day, I'd link to "Goedels incompleteness theorems", as it would definitively be on topic ;)