Partial correctness in computer science refers to a property of a program where, if the program terminates, the final state satisfies the specified postcondition, assuming the initial state satisfies the precondition. It does not guarantee termination, meaning a partially correct program may still run indefinitely without reaching a conclusion.