It's a bold strategy...
5,482 karma · joined September 19, 2011
It's a bold strategy...
This is laughable, it's not even remotely true.
/sarc
My conversations compact hundreds of times. By the time it has done a dozen or so compactions, it fully understands the work I want it to do (and how). It's almost like having a fine-tuned Astra model.
10/10, would recommend.
You could code for it now directly, instead of having to wrap a driver API. (There's also a few API bits missing on Metal today, that are present on Vulkan—and the the hardware can do it.)
[0] https://www.slatestarcodexabridged.com/Meditations-On-Moloch
I think we'll see a bunch of different architectures over the next five years.
Okay, so no efficiency improvement?
Wow, we should really trust these people today.
Their current plan is to take the existing architecture and shorten the cycle times: move all new RLVR work into mid-training on a pre-existing base; apply new RLVR. Rinse and repeat.
If you did that daily, it would be roughly similar to how humans improve.
Have you seen the labs training them?
Total horse shit, but that's the essence of it.
Ah yes, Lean 4. Famous for how unreliable it is. Absolute slop!
LLMs doing math has made math far more accessible to me than it was pre-LLM.
Not just using existing math, but developing new math. (For example, I developed an alternative to NURBS surfaces for geometric kernels using LLMs.)
It's really annoying that anyone, anywhere is talking about halting math progress with AI.
"Hey AI, here's how to hide what you're thinking in normal looking language. Have fun!"
A few moments later...
"Woah, how is it communicating with itself in ways we can't detect?"
It's a totally mystery, we may never know.
It can be used in headless-mode, I've hooked it up to the latest JavaFX text editing component it works very nicely.
Yup, TLA+ is a totally different beast from, say, Lean 4. Both are useful. I don't want dependent types in TLA+ either.
You shouldn't have listened to them, "incompleteness" only applies when you try to encode the language and meta-language in the same encoding—which no one actual does. (For example, programming language syntax is complete.)
Rather than provide tokens to developers, they instead sell finished software to the companies: specs in, software out.
Companies no longer need to employ software developers. Instead, they buy bespoke, bug free, guaranteed quality software from the AI lab.
Seems plausible to me.
Specific choices for instruction encoding is less interesting, especially in the age of AI.
> If Rust isn’t memory safe (because unsafe), and Zig isn’t (because uaf), then Fil-C isn't (because zunsafe_call/zunsafe_fast_call).
Rust isn’t memory safe (because unsafe) isn't an argument anyone makes, it's that Rust that uses unsafe isn't memory safe!
It's called `unsafe` for a reason dude, not even the Rust people think it's safe.
It's definitely not a constructive proof, even though it pretends to be; none of the mathematical objects can be constructed, nor can any of the algorithmic steps be executed.
That said, it's far less well-known that the workaround (if you find it to be true) is trivially easy (from Alfred Tarski), making it kind of a useless theorem in practice.
[0] You might think, well, I'll just write out the strings in order by using a generator! No sorting needed... But you have to write the strings down to perform the algorithm, and it takes infinite time to write down the first string, so you'll never even get to the others which is when you do the diagonalization trick. Like I said: it's not constructive, none of it can actually be done.