|
|
|
|
|
|
by t-writescode
12 days ago
|
|
|
Could also be a problem of the form of P=NP. Validating might be very easy, but writing might be hard. Like the traveling salesman problem. It’s very easy to tell whether a specific path takes N units of time, but it’s hard to figure out if there’s any path, among all possible paths, that takes N units of time. |
|
|