mholyland

NFL Plus offers local and primetime streams for $5/season[0].

0. https://id.nfl.com/subscriptions/select/nflplus

I've always thought that the Fed gets too much blame for the economy going badly, when all they can control is the interest rate and QE/QT. It's like an inverted pendulum PID problem[0] but with an unfathomable number of variables and stakes.

0. https://www.youtube.com/watch?v=I5GvwWKkBmg

I was listening to Jim Cramer discuss it this morning, and he said the banks are nervous about lending out money/investing, in what is usually considered safe. Things like US treasuries or real estate. They are fearing a liquidity crunch.

I'm looking for a more concrete source.

edit: Found a source: https://www.federalreserve.gov/releases/h8/current/

There are many languages with libraries that can use CSP (Communicating Sequential Processes)[0], but some popular languages that have it in the core libs are: Golang, Crystal and Clojure.

[0] https://en.m.wikipedia.org/wiki/Communicating_sequential_pro...

> It's never been clear to me why it's a good idea to continually adjust the rate, as opposed to picking an ideal target rate and trying to keep it relatively stable permanently.

That target rate depends on many things in the economy that the FED has no control over, so they adjust the knob as best they can predict, to stear the economy to their dual mandate.

They need to keep inflation low (around 2%) and employment high, but they don't control what the government does in terms of raising/cutting taxes, what world events do to supply, and production.

But you're right, it's a blunt knob to adjust when there are so many variables at play.

Has anyone tried:

https://web.archive.org/web/https://archive.org/

Have you considered Crystal?

https://crystal-lang.org/

True. My use of the word "speed" is incorrect, or at least imprecise.

The parent comment claimed that immutable data structures are slow, because you would have to copy them around, an O(N) operation.

I wanted to know if they considered that operations on immutable structures can be done without copying, and have the same algorithmic complexity as the mutable data structures, if they used persistent data structures.

Are you considering the speed of persistent data structures, that have the same big-O as their mutable counterparts? [0]

0. https://en.wikipedia.org/wiki/Persistent_data_structure