From the appendix:
TOTAL, COMPLETE, AND ABSOLUTE QUANTUM TOTAL ULTIMATE BEYOND INFINITY QUANTUM SUPREME LEGAL AND FINANCIAL NUCLEAR ACCOUNTABILITY
From the appendix:
TOTAL, COMPLETE, AND ABSOLUTE QUANTUM TOTAL ULTIMATE BEYOND INFINITY QUANTUM SUPREME LEGAL AND FINANCIAL NUCLEAR ACCOUNTABILITY
Yes - on the theoretical side, they do have an actual improvement, which is a non-asymptotic reduction in the number of multiplications required for the product of two 4x4 matrices over an arbitrary noncommutative ring. You are correct that the implied improvement to omega is moot since theoretical algorithms have long since reduced the exponent beyond that of Strassen's algorithm.
From a practical side, almost all applications use some version of the naive O(n^3) algorithm, since the asymptotically better ones tend to be slower in practice. However, occasionally Strassen's algorithm has been implemented and used - it is still reasonably simple after all. There is possibly some practical value to the 48-multiplications result then, in that it could replace uses of Strassen's algorithm.
Apparently MIT is teaching a vibe coding class:
How will this year’s class differ from last year’s? There will be some major changes this year:
- Units down from 18 to 15, to reflect reduced load
- Grading that emphasizes mastery over volume
- More emphasis on design creativity (and less on ethics)
- Not just permission but encouragement to use LLMs
- A framework for exploiting LLMs in code generation
ok i watched Starship Troopers for the first time this year and i gotta say a whole lot of that movie is in fact hot people shooting bugs
They're probably talking about Ziz's group. The double homicide in Pennsylvania is likely the murder of Jamie Zajko's parents referenced in this LW post, and the Vallejo county homicide is the landlord they had a fatal altercation with and who was killed recently.
Wait I know nothing about chemistry but I'm curious now, what are the footguns?
I read one of the papers. About the specific question you have: given a string of bits s, they're making the choice to associate the empirical distribution to s, as if s was generated by an iid Bernoulli process. So if s has 10 zero bits and 30 one bits, its associated empirical distribution is Ber(3/4). This is the distribution which they're calculating the entropy of. I have no idea on what basis they are making this choice.
The rest of the paper didn't make sense to me - they are somehow assigning a number N of "information states" which can change over time as the memory cells fail. I honestly have no idea what it's supposed to mean and kinda suspect the whole thing is rubbish.
Edit: after reading the author's quotes from the associated hype article I'm 100% sure it's rubbish. It's also really funny that they didn't manage to catch the COVID-19 research hype train so they've pivoted to the simulation hypothesis.
~~For some reason the previous week's thread doesn't show up on the feed for me (and didn't all week)...~~ nvm, i somehow managed to block froztbyte by accident, no idea how
the computational cost of operating over a matrix is always going to be convex relative to its size
This makes no sense - "convex" doesn't mean fast-growing. For instance a constant function is convex.
Yudkowskian Probability Theory
what a throwback
Simply asking questions would be SAQing off, which is totally different.
(From AI 2027, as quoted by titotal.)
This is an incredibly silly sentence and is certainly enough to determine the output of the entire model on its own. It necessarily implies that the predicted value becomes infinite in a finite amount of time, disregarding almost all other features of how it is calculated.
To elaborate, suppose we take as our "base model" any function f which has the property that lim_{t → ∞} f(t) = ∞. Now I define the concept of "super-f" function by saying that each subsequent block of "virtual time" as seen by f, takes 10% less "real time" than the last. This will give us a function like g(t) = f(-log(1 - t)), obtained by inverting the exponential rate of convergence of a geometric series. Then g has a vertical asymptote to infinity regardless of what the function f is, simply because we have compressed an infinite amount of "virtual time" into a finite amount of "real time".