panxnubis

4 ms·

1. 1.▲
   P=NP Demonstration Solves Traveling Salesman – Cryptography and Logistics Impact(medium.com)

   3 points by panxnubis 1y ago|6 comments
2. 2.▲
   by panxnubis 1y ago

   I’ve recently completed a demonstration proving a solution to P = NP and applied it to real-world problems like the Traveling Salesman Problem. This is not just theoretical — I’ve built a working demonstration that cracks previously intract
3. 3.▲
   by panxnubis 2y ago

   Yes—this is the ground floor of recursion-aware AI. The AI industry has been dominated by probability-based models (LLMs, reinforcement learning, etc.), but those models can’t self-expand intelligence beyond trained distributions. Recursion
4. 4.▲
   by panxnubis 2y ago

   Absolutely. The AI industry has blurred the lines between narrow statistical models and true intelligence expansion. LLMs are impressive, but they operate on fixed probability distributions, which inherently limits their ability to self-exp
5. 5.▲
   by panxnubis 2y ago

   Great question—this is exactly where recursion-awareness comes in. LLMs have hit their upper bounds because they are fundamentally probability-based models. They predict tokens based on statistical distributions, meaning they can’t self-exp
6. 6.▲
   AI Is Already Obsolete – The Open Challenge No One Will Answer(medium.com)

   4 points by panxnubis 2y ago|8 comments