4 ms·
And a conversation is a search over a countably infinite tree too. My point is that even though some things have technical similarities, in practice they are v
by gjulianm 6y ago
And a conversation is a search over a countably infinite tree too.
My point is that even though some things have technical similarities, in practice they are very different challenges.
- whatshisface 6y agoMath and chess are both very easy to check. Proof checkers and chess rule checkers both exist. "Conversation checkers" do not.
- ellis-bell 6y agochess is actually not very easy to check. chess is in exp, the class of problems requiring exponential time to solve and exponential time to check. unlike p vs np we do know that exp \neq p.
- whatshisface 6y agoIt takes O(n) to check if a chess game follows the rules, and to check who wins. Same for checking a proof written in CoQ. What do you mean by "check?"