kristintynski

Joined 13 years ago

Karma
879
Submissions
181
Member since
Oct 24
View on Hacker News

Recent submissions

Comment · 6 months ago
I'm the author. The reason is the first two papers were incomplete attempts at what this final work became. They did get attention, and I'm writing a paper with Garret Sobczyk a core aspect of this related to nilpotents and the fano plane. He approached me after reading those earlier papers.

I'm a nobody in terms of credentials, but I did find a unique approach that I think is worthy of a closer look. It does not use any of the typical angles with complex machinery like Hilbert Polya.

Comment · 6 months ago
Are you saying you think RH is unsolvabe? that any GUT will be a tautology by definition? or am I reading that wrong?
Comment · 6 months ago
Can you explain what you mean more? The proof doesn't rest on langlands or assuming anything else is true.
Comment · 6 months ago
I know its fun to poke fun at silly LLM attempts at the big problems, but did you read any of it? It's worth a deeper look.
Comment · 8 months ago
accurate but unrelated, lol
Comment · 8 months ago
This document presents a single structural constraint that provides explanatory compression across mathematics, physics, fluid dynamics, computation, biology, and consciousness. This is not a new physical law, but a recognition that all stable structures share one property:

They can refer to themselves recursively without accumulating distortion across scales.

This is not metaphor. It is the mathematical condition for existence.

Comment · 9 months ago
Comment · 9 months ago
Most systems that try to reference themselves across time, scale, destroy themselves.

The failure modes are boringly consistent:

runaway growth

collapse

phase drift / incoherence

What’s unusual is not that systems fail. It’s that any survive at all.

The document is an attempt to characterize the survivors.

When you formalize “recursive self-reference without accumulating error,” you get a hard constraint on scale ratios. In the simplest nontrivial case:

λ² = λ + 1

with φ as the only positive fixed point.

I’m not claiming this is a new law, and I’m not appealing to aesthetics, biology, or teleology. This is a structural claim:

recursive systems are extremely fragile, and only a narrow class avoids blowing up, collapsing, or decohering.

The note shows the same constraint and the same failure modes appearing in places that normally don’t talk to each other: fixed points, fluid modes, learning systems, biological loops, and self-models.

If this is wrong, it should be easy to falsify.

A single counterexample — a recursively self-referential system that’s provably stable outside this constraint — would break the entire framing.

I haven’t found one yet.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton