Properties Of Undecidable Problems
Which statement is true regarding undecidable problems?
A
They can be solved in polynomial time
B
They are always NP-complete
C
They require quantum computing
D
No general solution exists
Question Leaderboard
| Rank | |||||
|---|---|---|---|---|---|
| #1 | tatiman000 | 1 | 1 | 0m 00s | 100 |
| #2 | s13242 | 0 | 1 | 0m 00s | -10 |
| #3 | ballsgaming214 | 2 | 2 | 5m 12s | -112 |
Items per page:
10
1 – 3 of 3