If anything, some of the largest civil law countries in Europe, like Germany and Italy, can arguably be considered worse than common law countries in all of these respects. Whether that's incidental or due to civil law, I cannot say.
326 karma · joined April 20, 2021
If anything, some of the largest civil law countries in Europe, like Germany and Italy, can arguably be considered worse than common law countries in all of these respects. Whether that's incidental or due to civil law, I cannot say.
Am I not existing when I'm worrying about finances or fidgeting with my hair?
I don't really see why "existing" should be conceived in such a subtractive fashion.
I'm not dismissing the value of contentedness/meditation/stasis/passivity when achievable (which, as the author acknowledges, these things sometimes aren't). But I am slightly miffed by the implication that any failure to reach such state is an inability to attain something as fundamental as "existence".
(end rant)
I believe GP is using the stats/data science meaning of the word "censor" which is a neutral term simply indicating missing/obscured data (without implication of intent) [0]
V - E + F = 2
where V, E, F are the number of vertices, edges, and faces, respectively.
This holds for any polyhedron (and other shapes have similar equations possibly with a different right hand side) and the left hand side is called the Euler characteristic of the soccer ball (or any polyhedron).
Spoiler warning: the Wikipedia article for the Euler characteristic [0] has a worked out example specifically for the soccer ball.
FWIW the generalization of binomial coefficient which allows you to express an n-dimensional solution is called a multinomial coefficient [0]. So in a 3d 20x20x20 box we would have (60 multichoose 20, 20, 20) paths.
Also, the wiki article doesn't mention this but the growth rate of (n multichoose k1, k2, ..., km) as we increase n but fix the ratios p1 = k1 / n, ..., pm = km / n is precisely the Shannon entropy of the categorical distribution with probabilities p1, ..., pm . The wiki article for entropy [1] states the result for the binomial coefficient, which can be written as (n choose k) = (n multichoose k, (n - k)) .
Actually a lot of basic information-theoretic results about entropy and related quantities (e.g. the properties of the Boltzmann distribution/softmax function) can be derived from similar discrete counting problems after taking a large-n limit. I don't have links at the ready but I might edit this comment if I remember places which explain this stuff.
[0] https://en.wikipedia.org/wiki/Multinomial_theorem#Number_of_...
[1] https://en.wikipedia.org/wiki/Entropy_(information_theory)#A...
This has been by far the biggest and costliest failure mode I've experienced using these tools. I've tried to mitigate it in more ways than I can count but it almost feels structurally impossible for LLMs to get this right.
In the section for my native tongue, I zoomed in a few times, here and there, and I only once did I stumble upon an author I knew.
To me, writing a book feels like such a monumental endeavor that I find it hard to fathom the amount of collective effort that it took to write all this, especially considering how most of these works are almost forgotten by now (something something power law).
I went to a talk of his that was "interactive" in that to follow along you could play with an interactive widget, but I can't seem to find it right now. This one about plabic tilings (objects mentioned in the article) is fun too: https://www.math.ucla.edu/~galashin/plabic.html
ETA: I realize this sounds nitpicky and stickler-y so I just want to point out that I loved the book (and Greg Egan's work in general) and figuring out the automaton stuff was genuinely some of the most fun I've had out of a book.
Many interesting systems (like springs) are near equilibrium, which means that the potential energy is at a local minimum. A spring is an example, but also a pendulum.
When the potential is at a local minimum, its gradient is zero. So if you Taylor expand it you only get second-order contributions. For a spring, the potential energy looks like V(x) = V(0) + k * x * 2 where x is the displacement and k is a constant.
Differentiating, you get harmonic motion: F(x) = k * x
Broadly speaking, this applies to all systems near equilibrium, simply from Taylor expanding the energy. And it's not only in classical mechanics, but in all branches of physics. Sydney Coleman [0] is often quoted as saying something like "QFT is simple harmonic motion taken to increasing levels of abstraction." [1]
[0] https://en.wikipedia.org/wiki/Sidney_Coleman
[1] https://physics.stackexchange.com/questions/355487/qft-is-si...
https://en.wikipedia.org/wiki/Operation_Paperclip
From the linked article:
> The operation played a crucial role in the establishment of NASA and the success of the Apollo missions to the Moon.
Consider two scenarios:
1. H-1Bs get massively reduced over the next five years. Tech sector crisis ensues due to market shocks. Foreign workers decrease. American workers go up by 25% (~2.5M).
2. H-1B numbers stay as is. Tech sector relatively unperturbed. Foreign workers increase by 50% (~1.3M). American workers increase by 30% (~3M).
Wouldn't you argue that 2 is preferable to 1?
(I'm not saying that a crisis will happen if H-1Bs end, I'm just presenting two scenarios with different relative increases that I believe prove my point)
<pedantry>Isn't a language model made to predict the next token in a series, which just so happens to be good for predicting not only natural languages, but also formal ones (code and math)?</pedantry>
Also, similar to what nelox said, as long as language (or sequences of tokens or what have you) can be "about" something (whatever that means), then it's possible that LLMs are encoding information about that "something". I'm being deliberately vague because I think that trying to be precise (by e.g. referring to latent spaces and so on) makes it sound like we've figured something out when in reality we haven't even found the right words to ask the questions.
I sure find them beautiful and all, but why do they take center stage so often? Beside the aesthetics and instructional value, I don't get the appeal. Also I feel that a bunch of the heavy lifting behind metacircular evaluators is actually done by the Polish notation syntax as well as the actual implementation, and these concepts don't get nearly as much love.
Any Lisper who can illuminate me?
Also a resource I enjoyed is the book by Bobby Gramacy [0] which, among other things, spends a good bit on local GP approximation [1] (and has fun exercises).
chess - checkers = wormseed mustard (63%)
pretty funny and very hard to understand. All the other options are hyperspecific grasslike plants like meadow salsify.[0] https://coffeeadastra.com/2020/05/23/the-physics-of-kettle-s...
Every gradient is a Jacobian but not every Jacobian is a gradient.
If you have a map f from R^n to R^m then the Jacobian at a point x is an m x n matrix which linearly approximates f at x. If m = 1 (namely if f is a scalar function) then the Jacobian is exactly the gradient.
If you already know about gradients (e.g. from physics or ML) and can't quite wrap your head around the Jacobian, the following might help (it's how I first got to understand Jacobians better):
1. write your function f from R^n to R^m as m scalar functions f_1, ..., f_m, namely f(x) = (f_1(x), ..., f_m(x))
2. take the gradient of f_i for each i
3. make an m x n matrix where the i-th row is the gradient of f_i
The matrix you build in step 3 is precisely the Jacobian. This is obvious if you know the definition and it's not a mathematically remarkable fact but for me at least it was useful to demystify the whole thing.
[0] https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_....