> As a result, I don’t have much use for Memcheck, but I still use Cachegrind, Callgrind, and DHAT all the time. I’m amazed that I’m still using Cachegrind today, given that it has hardly changed in twenty years. (I only use it for instruction counts, though. I wouldn’t trust the icache/dcache results at all given that they come from a best-guess simulation of an AMD Athlon circa 2002.)
The few times I used the cache simulator and compared it to (Linux) Perf I found reasonable results. Someone can recommend a better cache simulator?
Very interesting, I studied telecommunications and I thought the Shannon limit was the absolute limit. I wonder now if this Gordon Holevo limit is applicable for "traditional" telecommunications (like 5G) as opposed to photon counting a deep space probe
As also explained in the conclusion of the paper linked by you, "photon-counting" detectors are possible only when the energy of one photon is high enough, which happens only for infrared light or for higher frequencies.
"Photon-counting" methods cannot be implemented at frequencies so low as used in 5G networks or in any other traditional radio communications.
Weird, it works for me. You can use any of the other published links in the sibling comments. The name of the paper is "Quantum Limits in Optical Communications" by Banaszek
This was the conclusion I reached after reading how it all developed back in the day. There was no independent monitoring/verification during the time this woman was supposedly in the cave, and it was confirmed afterwards by her own team that she went outside for for eight days "so technicians could repair a router". She also had a computer "without a clock", and was in great shape, did not even need sunglasses after all those days in a cave.
Not entirely sure what time reflection is, but I'm pretty sure it doesn't mean anything related to anything going backward in time. Here I think it's explained better https://spectrum.ieee.org/time-reversal-interface
Edit: Now that I've read a bit more, it seems to me this is just reflecting light back but "all at once". Like if a light signal were a train going right and the first wagon is A (>>>[D][C][B][A]>>>), a normal mirror would make it bounce and the train would go back going left and wagon A arrives first (<<<[A][B][C][D]<<<). A """time reflection""" would make the train return backwards and wagon D arrives first like this (<<<[D][C][B][A]<<<). I understand it is like reflecting each wagon at the same time so the train comes back reversed. This looks cool but I think the article deliberatively makes it confusing so it sound like the movie TENET when it starts talking about entropy
Really going above and beyond on that, "write a function that reverses a string in place" interview question, aren't they? I'm afraid I'll have to dock points in simplicity though.
