Yep, this does work, but limits us to questions where the argument in judge-understandable language is short enough that the debaters can write the whole thing down. So if the debaters run in P-time at deployment time, this gives us MA, not PSPACE as originally hoped.
I just mean that this method takes order(length of argument in judge-understandable language) time. So if the argument is large then you’re going to need to let the debate run for a long time. This is as opposed to the previous hope that even if the argument tree is exp-sized, the debate can run in p-time
Thanks!
Yep, this does work, but limits us to questions where the argument in judge-understandable language is short enough that the debaters can write the whole thing down. So if the debaters run in P-time at deployment time, this gives us MA, not PSPACE as originally hoped.
OK, I guess I’m a bit unclear on the problem setup and how it involves a training phase and deployment phase.
I just mean that this method takes order(length of argument in judge-understandable language) time. So if the argument is large then you’re going to need to let the debate run for a long time. This is as opposed to the previous hope that even if the argument tree is exp-sized, the debate can run in p-time