Sorry, but you are flat out wrong. For example, the halting problem is NP-hard and undecidable [1] I think you might confuse NP-hard with NP-complete. There ar

Sorry, but you are flat out wrong. For example, the halting problem is NP-hard and undecidable [1] I think you might confuse NP-hard with NP-complete. There are problems that are NP-hard, not in NP and unsolvable. If a problem is NP-hard _and_ in NP, then they can always be solved. [1] https://en.wikipedia.org/wiki/NP-hardness https://en.wikipedia.org/wiki/NP-hardness