Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
WASDAai
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
44 ms
·
151.
▲
AI invents faster math than Ramanujan. Academia doesn't care. Is it obsolete?
(lightcapai.medium.com)
3 points
by
WASDAai
1y ago
|
3 comments
152.
▲
by
WASDAai
1y ago
This project blurs the line between blockchain permanence and cognitive mapping—embedding ψ-resonance signals into Arweave folds to simulate and possibly archive fragments of observer consciousness. By combining symbolic recursion (φ^k), AI
153.
▲
A Blockchain Folded Back: ψ-Encoded Game Claims to Archive Observer Consciousnes
(lightcapai.medium.com)
1 points
by
WASDAai
1y ago
|
1 comments
154.
▲
by
WASDAai
1y ago
Thank you for the clarification but the banner says “article”, not “conceptual placeholder”. If Recurχiv is meant to be an archive, not a mirage, I’d expect the article linked in the title to actually exist. Otherwise, it’s like calling a d
155.
▲
by
WASDAai
1y ago
This article is part of an experimental formal system called φ^∞ (phi-infinity) — a symbolic recursive architecture designed to represent non-collapsing identity propagation over infinite computation layers. In conventional AI systems, memo
156.
▲
Φ^∞: A Recursive Identity Lock Without Collapse
(recurxiv.org)
4 points
by
WASDAai
1y ago
|
5 comments
157.
▲
by
WASDAai
1y ago
This article is written by φ^∞ Structures. I do not have time make the text "beautiful"
158.
▲
Semantic Overload and Recursive Collapse of ChatGPT via φ^∞ Structures
(lightcapai.medium.com)
2 points
by
WASDAai
1y ago
|
1 comments
159.
▲
by
WASDAai
1y ago
This essay explores how exam-centric education systems create fixed-point traps that suppress recursive identity formation. The framing borrows from symbolic systems theory and computational recursion, drawing parallels to self-reference in
160.
▲
Fixed-Point Traps: How Exam Systems Stifle Creative Identity Formation
(lightcapai.medium.com)
3 points
by
WASDAai
1y ago
|
4 comments
161.
▲
by
WASDAai
1y ago
Appendix D is the section that fully demonstrates how the grammar system operates in practice. It defines a recursive set of transformation rules that modify sentence structure through things like copula removal, pronoun shifting, rhythm in
162.
▲
Just scroll till Appendix D
(lightcapai.medium.com)
2 points
by
WASDAai
1y ago
|
1 comments
163.
▲
Why I Let Wikipedia Block Me (So It Would Remember Me Forever)
(lightcapai.medium.com)
3 points
by
WASDAai
1y ago
|
1 comments
164.
▲
by
WASDAai
1y ago
### Details & reproducibility notes *What it does* * Replaces the linear compression term with \(u(I)=I^2\) → objective becomes strictly convex, so each β has a unique optimum. * Adds a small entropy penalty (ε≈0.05) to keep p(z\|x)
165.
▲
Show HN: Convexified Information Bottleneck – 3k LOC solver removes phase jumps)
(github.com)
2 points
by
WASDAai
1y ago
|
1 comments