3,061 karma · joined December 1, 2014
To see a representative stream of papers, go to arxiv and look through the recent graphics papers.
And a GPU does orders of magnitude past this.
Networks are not even close.
https://chipsandcheese.com/p/a-new-year-and-new-tests-gpu-l1...
https://commandlinux.com/statistics/linux-kernel-contributor...
That page shows 99.5%+ uptime across all 11 of the services provided.
To do that at a small company world cost significant money.
To have it integrated and cheap for all those small shops is very valuable to them.
All the slippery slope nonsense on this page has failed so many times it’s not worth debating. If you don’t like this tool, use another. When they embed your social security number and face and address in the mark get back to me.
So making it seem as if all "controlled digital lending" is not allowed under current law, even under the description you give, is not that simple.
No, it was not, even supported by the quotes you pulled. Libraries right now, with publisher blessing, offer all manner of controlled digital lending. The suit was because IA did it buy undercutting the publishers copy rights to that legal market. Had IA simply done what every other library has done to provide controlled digital lending, there would be no suit.
So there’s plenty of evidence.
Now provide evidence it’s technically possible to make any font “ that is financially infeasible for LLMs to parse but easy for humans.”
“Claude: make the scraper mimic a screen reader.”
And just like that, in 10 seconds, their site feeds my “screen reader” the real words.
Seems oddly sour grapes.
And using Golang? That ludicrously slow also.
To tell us what a cpu can do, do them using SIMD, you get pipelining and then many values per clock. Now try that with AES. Oh, you cannot, it’s not supported.
And people needing lots at full speed will do them on GPUs.
There is no world where even HW accelerated crypto comes close to non cs prngs on mainstream HPC systems.
I’ve a PhD, have written papers on PRNGs, have worked in both cs prng and high perf prngs, have done decades of HPC projects, scientific sims. I get called in to develop precisely these high performance systems, and when you want to replace trillions to quadrillions of PRNG calls with one costing 10-1000x more, you’d get deservedly fired immediately.
You keep arguing about AES style code on a CPU. That’s not where people do high performance code. Try implementing AES and a fast prng on a GPU. You’ll soon find out how absolutely terrible cs-prngs are at performance. The measuremt isn’t how many ns per prng. It becomes how many thousands of prng generated per ns.
It’s bafflingly shortsighted for people with zero work in this area to continue to argue this. Choose the right tool for the job. Don’t project ignorance as knowledge. Both are useful advice.
Which led to a spectacular failure of incoming students to do basic math, lead to massive increases in failures in first year math courses.
Maybe removing signal loses knowledge about who is ready for standard classes?
For any NN to learn, the function it is approximating must structured enough to admit small set of parameters (i.e., not exponential), otherwise it will take exponentially many nodes to do anything. AES is not differentiable, as are all secure hash and encryption functions. This is a basic test that is used to attack everything.
So you'd get a NN that must be big enough to simply memorize all plaintext, key, output triplets, which is simply a lookup table. With around 2^768 nodes. Good luck.
So around 30 years now.
Also bond returns have averaged 5% over decades, not 7.
Not taking all this into account, and simply claiming bogey men took your money, is misleading.
Not likely. The last 50 years had Moore’s law growth in compute. That’s over. Frontier models are roughly compressed all written text and a large part of images. Those don’t compress forever, and likely not a ton more than now.
Inference requires touching a significant of that per token.
All of these are up against fundamental limits, more or less.
Reversing arrows again, back to recursion, you have exactly the standard labeled bases case (well, cases in your code), and reversing arrows doesn't magically change algorithms or invent new structure, so it completely equivalent in the category.
For that code, the 1:1:... is exactly the terminating/starting point, reversing arrows in the category does nothing to change the requirements.
That it has not solved everyone's problems on the planet is no argument it against what it has provided more than any other system.
It's surprising how many of your comments place you in the US, and not one in Burundi. I'm guessing based on your past comments you're not too consistent on your claims.
> Nobody said this, asshole
You claimed they provide little value against obvious reality. We're done.