|
|
|
|
|
|
by fnrslvr
2399 days ago
|
|
|
Fair. The topic is often taught to students without broaching the topic of Turing machines. I think we agree that as a matter of actually building the topic of NP-completeness, nailing down a concrete model of computation for the verifiers which can itself be operated upon constructively is vital. |
|
|