Using DuckDB as a Unix Tool
duckdb.org44 pointsby wenc2 comments
"use the writing.md steering on x.md and loop until all LLM traces are removed".
I ran it on TFA and Pangram flagged it as LLM generated but Claude Fable couldn't definitively tell. Detection is a whole-document pass, not a per-paragraph glance. Read the entire piece and mark every sentence or sentence pair that negates one thing to elevate another, including the comma-tag and gapped variants above. Count the marks. More than one per ~300 words, or more than three in a short piece, means the reversal has become the default sentence engine, which is the machine tell. A single dense paragraph with two stacked reversals also counts.
Fix by thinning, not by deleting all of them. Keep the two or three that land on the strongest turns. Rewrite the rest as plain declaratives that state the point with no foil ("The bottleneck is attention now." instead of "Hours aren't the bottleneck. Attention is."). Removing every instance flattens the voice, so the aim is to make the survivors rare enough to regain their force.
6. *Repeated hedge adverbs.* A softener like "almost", "somewhat", "rather", "a bit", or "fairly" used more than once in close range becomes a tic. Keep at most one, and only where it earns its place.
GPT wrote some SymPy code to check it. The response?
"As written, this is an explicit counterexample to the Jacobian conjecture. I checked it using exact symbolic algebra.
I do not see an algebraic catch in what you typed. Unless a term or exponent differs from the intended expression, it appears to disprove the conjecture. This deserves serious independent checking rather than casual dismissal."
Waiting for someone to write the Lean proof.