FYI, you may want to reconsider the naming as there's already a fairly popular service named Kapso [1] for integrating WhatsApp into other products (not related btw).
Yeah, originally, it came from first letters of "Knowledge-grounded framework for Autonomous Program Synthesis and Optimization", then a few weeks later, we saw this Whatsapp integration product. For the moment, our pip is "leeroo-kapso", but we're considering to change the name! Thanks for the recommendation.
As a very heavy Kapso user (the WhatsApp product), I really think you should change the name.
Not only because they were first and it's an amazing product. It's also growing tons, in a market with many people (basically everywhere WhatsApp is the defacto communication channel).
Your product will be buried under their success in SEO and GEO.
There are Street View photos that look like they were taken from someone driving down one of the side streets so you can pretty much walk on it. You can see apartment buildings, local shops, people going about their day... It’s heart-wrenching to contrast that life with the current aerial view, with nothing but rubble and destruction.
They don't, that's the point. All of the street view footage is from before the start of the current genocide. Gaza is under one of the most complete internet and media blackouts on earth, even the roaming international sim card loophole has been closed.
This is kind of why P vs NP is such an interesting problem. It seems that a big family of NP-hard problems in fact _can_ be solved efficiently if we allow relaxing some constraints, like optimality (eg TSP), or generality of our algorithm (eg type checking).
I feel that is similar to how adding randomness to cryptography [1] opened a bunch of new systems like zero knowledge proofs[2]. By allowing us to be wrong in a very small number of instances (arbitrarily small by adjusting things like key size), we can build practical systems with really impressive properties.
A personal favorite of mine is fixed-parameter tractability. Instead of analysing the worst case running time solely on the input length we introduce a *parameter* and study the time complexity in both. Intuitively, the parameter „should“ be small and is often chosen to be the solution size or some specific measure of the input.
Consider the vertex cover problem where you want to cover all edges of a graph by at most k vertices (that are incident to all edges). It is a classical NP-complete problem and the naive bruteforce solver needs something like n^k time. Which is already huge for small k, say, 10.
A very simple fixed-parameter tractable (fpt) algorithm for this problem achieves a worst case time of 2^k * n.
For huge graphs and small k (again, let’s say 10) this is a massive improvement.
This is a very active field, where we have a good understanding which problems allow have such a worst case time and which not (under some complexity theoretic assumptions of course). It incorporates also the idea of restricting the input to only specific „simple“ instances gradually. This happens if you add graph measures as a parameter.
Many NP-hard graph problems are in P if restricted to planar graphs. But what if the instances are „almost“ planar?
If you choose a parameter that measures the structure of a graph such that the measure is low if the graph is planar and high if it isn’t, any fpt algorithm for this parameterization works on any graph; fast if it is planar, and fast-ish if it is close to being planar.
Of course, this is theory with the similar metaphysical caveats classical complexity theorem has. However, it results in interesting algorithmcsl tools and interacts nicely with specific fields of structural graph theory.
A couple of months ago I wrote a small post [1] (in Spanish) about subsampled MRI image reconstruction using compressed sensing and how it relates to government funding issues. At the time Tao had written some posts [2] about how the IPAM, where Terrence Tao was working, was losing some funding because UCLA wouldn't follow some new federal government policies.
[1] https://kapso.com/
reply