Re:Why cryptography is not based on NP-complete problems
by gpm on Thursday February 13, 2025 @12:00AM
(#43032820)
Not undecidable, it's just not possible to verify if an answer is correct in polynomial time. There are problems know to be decidable, known to be NP-hard and outside of NP. (E.g. in NEXPTIME)
https://en.wikipedia.org/wiki/NP-hardness