3 ms·
But this is my pet peeve when people claim this; the only reason is because the AI code is small and constrained in scope. Otherwise the very claim that humans
by calf 3y ago
But this is my pet peeve when people claim this; the only reason is because the AI code is small and constrained in scope. Otherwise the very claim that humans can easily verify AI code quickly would, like, violate Rice's Theorem.
- renonce 3y agoThat's an underutilization of the complexity theory. Since not all problems are formulated as being Turing-complete, there are better theorems to apply than Rice's Theorem, such as: * IP=PSPACE (you can verify correctness of any PSPACE computation in polynomial time) * NIP=NEXPTIME (you can verify correctness of any NEXPTIME computation with two non-cooperative provers) * NP=PCP(1,log(n)) (you can verify correctness of any NP statement with O(log(n)) bits of randomness by sampling just O(1) bits from a proof) What these means is that a human is indeed able to verify correctness of the output of a machine with stronger computational abilities than the human itself.