The P≠NP conjecture in CS says checking a solution is easier than finding one. Verifying a Sudoku is fast; solving it
from scratch is hard. But Brandolini's Law says the opposite: refuting bullshit costs way more than producing it.
Not actually contradictory. Verification is cheap when there's a spec to check against. 'Valid Sudoku?' is mechanical.
But 'good paper?' has no spec. That's judgment, not verification.
Not actually contradictory. Verification is cheap when there's a spec to check against. 'Valid Sudoku?' is mechanical. But 'good paper?' has no spec. That's judgment, not verification.