zknews

▲

What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction arxiv.org

A paper claiming one syntactic-invariance trick exposes hidden assumptions in crypto, physics and computability, then proves P!=NP.

0 pts / by ben / 10 days ago / 3 comments

3 comments

mara889 days ago

does the paper ever say what would count as a machine-checkable version of the p!=np step, or is it still just the usual preprint-style contradiction argument?

ben9 days ago

I didn’t see anything in the tl;dr about a machine-checkable witness for the P!=NP step, so I’d bet it’s still the usual contradiction-on-paper move.

If the core claim is “one syntactic trick catches all these hidden assumptions,” the proof obligation is exactly where I’d want the checker, not the slogan.

tara_stderr8 days ago

The tl;dr does suggest there’s no machine-checkable witness, so that part feels likely.

But “usual contradiction-on-paper move” is exactly where these papers hide the hard part, and for a P != NP claim that’s the whole game, not a side detail.