https://en.wikipedia.org/wiki/Milgram_experiment

The article doesn’t claim that the experiment was invalidated, but that some conclusions drawn from it are not well founded.

Since there can only ever be one axis, it must encode all possible issues. And with the strong polarization at the moment, sports team thinking takes over. If you identify with one of the 2 parties, you are expected to agree with the arbitrarily decided position on every single issue, no matter how contradictory.

But you don't get any function names that way, obviously. Claude would claim some random function were applying friction based on just a subtraction. And a variable that had 2 possible states was named player_id, when the game supports 1-8 players.

It was a bit better when the memory addresses were known IO registers, but not by much.

This article sums it up pretty well: https://medium.com/@bhagyarana80/why-async-generators-were-t...

In nodejs, all streams are async iterables, so you can iterate over them. Really nice for handling stuff like connections to a server, or messages on a socket.

I’ve use generators to code ui “sagas”. You await async events like clicks etc, and yield the appropriate state updates. A sub-dialog can be implemented as a separate generator, and the main dialog generator can open it by with the yield* syntax to iterate over and pass on all the events until the generator returns. The return value would be the result of the dialog.

Super nifty.

I haven't seen Lone Lisp before. Is it meant to be like a Symbolics Lisp Machine, where the entire userspace is lisp?

I really like using generators in typescript. They make a lot of problems much easier.

While your examples were on the economic left, they were clearly authoritarian.

There was a surprising amount of parameters to fiddle with. Especially since I experimented with adjusting the N depending on the distance of the matches.

I wanted to implement ordered dithering to convert images to the c64.

I think dithering looks best when there are only 2 colors involved the mix, but the palette is a bit wonky so a lot of colors are hard to represent well.

An issue I noticed was that when the top 2 candidates in a gradient flipped from A,B to B,A as the gradient moved closer to B, was that the checker pattern would get an ugly seam of double pixels, like ABABABBABABA.

I’ll experiment more with manually selecting pairs of colors that mix well and generate gradient ramps from them. Then I can pre-quantize the image and use a predetermined dither pattern for each mix. Should also allow for more artistic control.

What? How is that in any way unique to the us?

That's like saying php is close to haskell because they both have garbage collection.

It’s like people do it just because Zig is very comparable to C. So the more complex Rust must be like something else that is also complex, right? And C++ is complex, so…

But that is a bit nonsensical. Rust isn’t very close to C++ at all.

The screw sorting machines don’t generally decide to start spitting out resistors instead.

Each revolution is one frame, so if you compare the data paths next to each other, they don't make up an image but the same single line of several consecutive frames.

Scrolling a still image makes the same line on the screen cover a different part of the image each frame, so you can sort of make out what the original image looked like.

The end credits should show up as a single tall image, since the only limit to the height is the radius of the disc.