Timeline for What is the computational complexity to verify a P solution with a deterministic Turing machine? [closed]
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27 at 13:50 | vote | accept | XL _At_Here_There | ||
| Aug 27 at 12:11 | history | closed |
Sam Nead Andrés E. Caicedo Daniele Tampieri Emil Jeřábek Sam Hopkins |
Needs details or clarity | |
| Aug 27 at 9:47 | review | Close votes | |||
| Aug 27 at 12:11 | |||||
| Aug 27 at 9:46 | history | undeleted | XL _At_Here_There | ||
| Aug 27 at 9:11 | history | deleted | XL _At_Here_There | via Vote | |
| Aug 27 at 7:14 | history | edited | gmvh | CC BY-SA 4.0 |
Removed garbage at top of post, added top-level tag
|
| Aug 27 at 1:03 | comment | added | Sam Hopkins | When you say "If we have a solution of P problems, what is the computational complexity to verify the solution with a deterministic Turing machine?" are you talking about about verifying that a program (i.e., another Turing machine) correctly answers the decision problem on all inputs, or are you talking about verifying that an instance of the decision problem gives the answer "yes"? | |
| Aug 27 at 0:49 | answer | added | Joel David Hamkins | timeline score: 1 | |
| Aug 27 at 0:13 | review | Close votes | |||
| Aug 27 at 9:13 | |||||
| Aug 26 at 23:04 | history | asked | XL _At_Here_There | CC BY-SA 4.0 |