No, by the Arslanov completeness criterion $0'$ is only DNC (Diagonally non-computable) relative to low sets. And PA implies DNC.