Computer scientist. Supercomputer pseudo-scientist. Former U.S. Navy cryptologic technician.
Joined July 2024
- Tweets8.8K
- Following242
- Followers448
- Likes10.5K
A second (and 3rd?) heart in our legs.
My dad died earlier this year from complications due to diabetes. Walk more. Stand on tip toes a bunch of times. Don't die from bad doctoring.
youtube.com/watch?v=H5ez2Rse…
I used to make stupid stuff like this all the time. In a world before AI. Now I can't imagine spending hours drawing all that.
youtube.com/watch?v=-sY0MaT-…
Integer factorization is really hard. So hard that recently the first RSA number since 2020 was factored. These numbers have been public for decades, and used to have huge financial rewards if anyone solved one. No "Quantum" there. Just regular nerds with far too much compute.
Find it a little strange that all those "Most experts" always seem to predict things just far enough in the future that nobody questions them.
Despite my experience, I'm not an expert, but I know enough to look for signs that something is off. Look at Shor's algorithm, a real technique for attacking real problems. Notice anything missing?
Have you ever seen Petri nets displayed with so much valuable information? Probably not, @Grok just created it for me.
Beautiful!
Maybe a better example of what's going on:
Because I know from experience how big the problem set usually is, sometimes I get lazy and quit as soon as it's "Good enough."
In this example, I even left an old version sitting there commented out. @Grok made it a true binary search, using helper functions, and finished the job so iteration can go in both directions instead of just forward.
Certainly I can come up with situations where grok's binary search will be faster, and that's the way I want it even though I know my loop will only have ONE iteration 99.9% of the time.
