If this proof holds, it means that quantum computers are only polynomially faster than classical computers for general problems. Shor's algorithm is an exception, not the rule.
« J'ai deux passions ! »
Ambiance festive pour le concert géant de l'orchestre du Nouveau Monde sur la Place de la République à Paris.
#grevegenerale#5Novembre#greve5novembre
We asked GPT-6 Astra to edit Qwen3.5-0.8B weights to improve math.
It directly changed only 0.016% of weights, fixing 0.8B's reasoning loops & improving math up to 6x and even instruction following 3x, without gradients or training.
We call this Weight-Space Programming: frontier LLMs can now natively read/write neural network weights! 🧵
Blog: https://t.co/bOWCcFhCVq
Our second product is called Blindsight and it will, as the name suggests, enable even those who are completely blind or have never seen to see.
It is ready from an engineering standpoint. Just waiting on regulatory approval.