Viewing profile — DevelopingElk

CPS is a way of embedding imperative computation into an FP language. I think they built a mini compiler for their binary relation language, which is then Jitted by Julia.

Russian one time pads were frequently broken. How? They were inconvenient to distribute, so people reused them. Symmetric cryptography is safer because one key can easily protect a…

One of the data center's cooling loops broke.

I ran into this problem where I wanted to generate balanced trees for test cases, and I decided to crack it with math. Let X = the number of remaining open parenthesis required to …

His claim is that we exp-minus-log cannot compute the root of an arbitrary quintic. If you consider the root of an arbitrary quintic "elementary" the exp-minus-log can't represent …

According to the article “This work effectively rules out explanations of the Hubble tension that rely on a single overlooked error in local distance measurements". So any systemic…

Good? Bad? Doesn't matter as long as you had fun. Have you tested this GCs performance? Sometimes a baby GC can be fast enough.

The issue with Regex for parsing is it can't handle balanced parentheses. https://en.wikipedia.org/wiki/Regular_expression . More generally, they can't handle nested structure. Con…

I'm fairly sure this was human written.

Rust's discussion boards has an idea of "keyword generics" for expressing some of these concepts. The idea is that a function can be generic over const, async or some other keyword…

Yours might go a little less into the details, but its really clear and I like the diagrams and explanation around glitch hazards. Please do follow up on your tangents if you have …

I have commented once or twice on articles being AI generated. I don't put them when I think the writer used AI to clean up some text. I added them when there are paragraphs of mea…

This is written by an LLM account. My guess is this article was created with some human guidance too, but the profile shows LLM patterns.

The start of the article is good, but it starts to sound like LLM staring at the "Why this maps to Genetic Algorithms?" section. Is that the case?

By the definition of a cryptographically secure PRNG, no. They, with overwhelming probability, produce results indistinguishable from truly random numbers no matter what procedure …

I worked on a team deploying a service to European Sovereign Cloud (ESC). Disclaimer - I am a low level SDE and all opinions are my own. AWS has set up proper boundaries between ES…

The consequence of Noether's theorem is that if a system is time symmetric then energy is conserved. On a global perspective, the universe isn't time symmetric. It has a beginning …

RL before LLMs can very much learn new behaviors. Take a look at AlphaGo for that. It can also learn to drive in simulated environments. RL in LLMs is not learning the same way, so…

Oof, I think that you are right. The issue with Futurelock is a failure of liveness, where the Future holding the lock doesn't get polled. tokio::join! would keep it alive and ther…

Disclaimer - I'm not a Tokio dev so what I say may be very wrong. Some definitions: Future = a structure with a method poll(self: Pin , ...) -> Poll ; Futures are often composed of…

It is well known that Rust's async model can lead to deadlocks. However, in the futurelock case I have come around to blaming the Async Locks. The issues is that they are not "fair…

I would say, though, that for most programs any one of the most popular languages would do the trick. By this I mean Java, Go, C#. Javascript, Python, C++. All of those are general…

My view of this is that its closer to the basic 2 lock Deadlock. Thread 1 acquires A. Thread 2 acquires B. Thread 1 tries to acquire B. Thread 2 tries to acquire A. In this case, t…

DynamoDB is working on going cellular which should help. Some parts are already cellular, and others like DNS are in progress. https://docs.aws.amazon.com/wellarchitected/latest/re…

The start is good, but later paragraphs appear to be mostly LLM.