Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2025 to Jun 2025. Found in 1 HN submission from Feb 2025 to Feb 2025. Open submission discussions.
To try and help people digging into this, the following helped me. Two lenses for trying to understand this are potentially Chastain's limits on output of a lisp program being more complex than the program itself [1] or Markov's proof that you can't classify manifolds in d>= 4.…
To try and help people digging into this, the following helped me. Two lenses for trying to understand this are potentially Chastain's limits on output of a lisp program being more complex than the program itself [1] or Markov's proof that you can't classify manifolds in d>= 4.…
nyrikkiView on HNParent context