Alternatives
Products that do what Student attempt at proving P ≠ NP using geometry and lattices does
Hi everyone, I’m a student with a strong interest in computer science and complexity theory. Recently, I worked on a manuscript attempting to prove that P ≠ NP. I know how this sounds — it’s one of the hardest and most debated problems in CS, and many have tried and failed. I don’t claim to have the final answer, but I believe the approach I used might at least offer some fresh perspective or provoke useful critique. The idea involves geometric separation between deterministic and nondeterministic computation, using high-dimensional lattice constructions and some physics-inspired intuition.…
- 1IM
This is the first iteration of a short game I’m making that tries to interactively explain some of my favorite math questions / ideas. My goal is mostly to get the player curious and not necessarily to explain absolutely everything. There were a lot of fun technical parts to building this: - For implementation reasons, it’s much easier if the lines all have integer intersection points with each other. To do this, when a new line is added I “cheat” by rounding intersections to integers and then splitting the old lines at the intersection into new linds (with potentially different slopes)…
2024 · rahulilango.com
- 2AM
2012 · github.com
- 3FP
This project aims to formalize the first volume of Prof. Bertrand Russell’s Principia Mathematica using the Lean theorem prover. Throughout the formalization, I tried to rigorously follow Prof. Russell’s proof, with no or little added statements from my side, which were only necessary for the formalization but not the logical argument. Should you notice any inaccuracy (even if it does not necessarily falsify the proof), please let me know as I would like to proceed with the same spirit of rigour. Before starting this project, I had already found Prof. Elkind’s formalization of the Principia…
2025 · github.com
- 4PC
2017 · proofcompanion.com
- 5VA
I was fascinated reading through another recent HN submission about a highly efficient implementation of A* in Lisp, which got me thinking about how I could do something similar in Python. However, these kinds of pathfinding algorithms really need complex terrain/mazes with interesting obstructions to showcase what they can do and how they work. So, I started thinking about how I could generate cool and diverse random "mazes" (they aren't really mazes, but I'm not sure what the best term is). I got a bit carried away thinking of lots of different cool ways to generate these mazes, such…
2024 · github.com
- 6MT
2020 · mathtocode.com
- 7IM
I've been playing with this for quite some time and I think it's finally ready for public consumption. All feedback welcome.
2025 · madmonk13.github.io
- 8PA
2021 · apress.com
- 9IT
2018 · wykobi.com
- 10AN
2018 · github.com
- 11IM
Hey there! I'm the brains behind the math crossword game on my site. This game is all about making math a little more fun – users just drag and drop numbers to fill in the blanks and move on to the next level if they get it right. Let me know if face any issues or have any suggestions! :)
2024 · scientific.place
- 12IW
I’ve been working on a puzzle game for a few years as a side project. The game is based on a small region of tiles in a grid that is mirrored, modified, and mirrored again. It’s based on a novel phenomenon I noticed where, once these mutations happen a few times, the original region can be hard to recognize. You have a feeling there are symmetries in the image, but they are just out of grasp. Going further, if only part of the region is visible, such as mirroring off the edge of the board, it adds to the feeling and it becomes a satisfying puzzle to solve. I originally published this on the…
2024 · hidden-mirrors.com
- 13FV
To my knowledge, this is the first formally verified implementation of an intersection algorithm for polygons. The experience of working with AI agents on this project changed a lot with recent model releases, as I describe in the readme. Opus 4.8 is able to provide algorithm implementation with formal proof in one shot, whereas previous models required me to provide proof strategies in multiple steps. Trust in the correctness comes entirely from the Lean checker and human review of a small specification, not from the LLM. Also check out the web demo built around the verified core linked in…
Jun 2026 · github.com
- 14PS
Hi HN, I turned the freshly published paper “The Constructor Theory of Time” by David Deutsch and Chiara Marletto (arXiv, 13 May 2025) into an executable Python library. What you’ll find • One-to-one translation of the paper’s formalism: Substrates, Attributes, Tasks, Constructors, and task-algebra operators • Possibility / impossibility predicates and counterfactuals encoded exactly as defined • Test suite that mirrors every lemma and example (>95 % coverage, mypy-typed) • Reproductions of key results: time-keeping substrates, irreversibility proofs, quantum branching tasks, and a…
2025 · github.com
- 15AA
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io
- 16AA
2019 · github.com
- 17MN
2020 · github.com
- 18SA
Hey HN, I’m a physicist turned quant. Some friends and I 'built' SymDerive because we wanted a symbolic math library that was "Agent-Native" by design, but still a practical tool for humans. It boils down to two main goals: 1. Agent Reliability: I’ve found that AI agents write much more reliable code when they stick to stateless, functional pipelines (Lisp-style). It keeps them from hallucinating state changes or getting lost in long procedural scripts. I wanted a library that enforces that "Input -> Transform -> Output" flow by default. 2. Easing the transition to Python: For many…
Feb 2026
- 19CS
2021 · github.com
- 20SM
In past few weeks, I wrote several chapters to learn Scheme, a programming language of the Lisp dialect. The writing is not final as many chapters are missing. I wrote this because I wanted to improve my Scheme knowledge and increase the (low) number of Scheme literature. The writing is inspired by Calculus Made Easy, which I learned about here on HN. This is why I'm sharing it here. But keep in mind that my writing style is not as good as that in the above-mentioned inspiration. Feedback is very much appreciated.
2024 · schememadeeasy.com
- 21CJ
2015 · github.com
- 22E0
2017 · github.com
- 23GC
2020 · programmingdesignsystems.com
- 24OS
We’ve just released an open-source library for solving the Maximum Independent Set (MIS) problem with neutral atom quantum computing, running on both quantum processing units (QPUs) and classical hardware, thanks to emulators. This project is the result of collaboration between Pasqal, academic researchers, and industry partners, aiming to make it practical to experiment with quantum approaches to hard combinatorial optimization tasks. The MIS problem appears in real-world scenarios like scheduling, resource allocation, and network optimization, areas where classical solvers often struggle…
2025
Ranked by how close each launch is in meaning, then by votes. Refine with a description →