tooltower

It turns out they intentionally drain a bit of the storage capacitor, and amplify that weak signal. Some of that amplified charge is then fed back to storage.

Is there a standard mechanism for batch-downloading a public site? I'm not too familiar with crawlers these days.

Usually, zero knowledge proofs also require a prover who knows the answer (the factors in this case). This is just a primality test that can be performed locally.

It's very much trying to go _under_ the abstraction layer to investigate its behavior. Because it's interesting.

This is very similar to how people investigate performance quirks or security issues.

These hashes are not collision-resistant.

You can only deduce a distribution from repeated measurements. But most physicists would have no problem talking about a single experiment having many possible outcomes, governed by a probability distribution. It's almost a philosophical question about whether probability means anything in single systems.

It's the same way in quantum mechanics. The effects of entanglement can only be discerned if you take repeated samples. But we still feel okay talking about single systems governed by such entanglement.

The canonical answer to your question is Bell's inequality: https://en.wikipedia.org/wiki/Bell's_theorem. But TL;DR: the distinction only shows up in the statistics of repeated experiments. There is _no way_ to distinguish them in single-fire experiments. Entanglement is defined in terms of "odd" statistics.

In repeated measurements of related properties (e.g. spin along varying angle), entangled systems show more correlation than it should be possible classically.

Yes, I'm more likely to leave reviews if I'm unsatisfied. Yes, people are more likely to leave CS if they were unhappy. Biased data, but still useful data.

I have had to go through a few that feel extremely dangerous compared to having all cars stop for me. So I know I must be missing something.

Edit: Also, I see a lot of comments on yield. I'm probably confused too, but how do they work when traffic is non-stop? Is there a specific traffic rate beyond which roundabouts become less safe?

Is there a place we should subscribe to?

Is there a book or article that talks more about this? I.e. how to write code in a way that is more amenable to model-checking (bounded or otherwise)?

Is there already an article that describes this well?

Caveats:

* "uniform distribution" is a tricky concept over infinite countable sets. Famously, it doesn't exist. You have to restrict the length or something.

* I have no idea if there's a concrete result linking Kolmogorov complexity and solving ease. I suspect no, since even a complex but known problem can be solved rather quickly by special-casing.

A single sentence with a quick brown fox is often not enough.