Strilanc

33 ms·

391.
by Strilanc 7y ago
> the driver got a lot of heat for fumbling with her phone (or 2nd computer?) right before the accident Based on news stories I found, she was glancing at a television show on her phone [1]. > make the car sound its horn when it ge
392.
by Strilanc 7y ago
> 5.6 seconds before impact, it classified her as a vehicle. Then it changed its mind to “other,” then to vehicle again, back to “other,” then to bicycle, then to “other” again, and finally back to bicycle. System can't decide wha
393.
by Strilanc 7y ago
Here's a youtube video that might be at just the right level for you: https://www.youtube.com/watch?v=ZoT82NDpcvQ . Basically it goes over the simplest quantum-vs-classical query advantage (1 instead of 2) that was eve
394.
by Strilanc 7y ago
I don't think the argument is novel, it's just a cut down counting/frequency argument. So any objections to those would presumably port over.
395.
by Strilanc 7y ago
What do you think of the simplified argument here: https://algassert.com/post/1902 ? Basically: ground the definition of probability into a reversible classical circuit then use that circuit's quantum behavior to
396.
by Strilanc 7y ago
Just another "X1 implies Y, X2 implies Y, X3 implies Y, ..., Xk implies Y; we observed Y; therefore X2" article about quantum interpretations.
397.
by Strilanc 7y ago
I agree that the discretizing step is hard to get right. I agree that you don't have enough time in an engineering interview to get Vose's algorithm right (nevermind think of it in the first place). I was definitely imagining that
398.
by Strilanc 7y ago
You make a list of below-average bars and a list of above-average bars. Iteratively pop the top of both, donate from the larger to the smaller until the smaller is average, then put the larger back into the appropriate list based on its new
399.
by Strilanc 7y ago
For some reason alias sampling is not well known, even though it strictly dominates using a search tree when generating randomness (it's faster, it uses less memory, and IMO it's easier to code). It even works better when generali
400.
by Strilanc 7y ago
Actually addition is reversible, as long as you do it inline. The inverse of `a += b` is `a -= b`. An example of an action that's not reversible is masking: `a &= b`. But if you dig deep enough into the physics, you find that the
401.
by Strilanc 7y ago
https://iopscience.iop.org/article/10.3847/1538-3881/ab31ab > For planets with sizes 0.75–1.5 R ⊕ and orbital periods of 237–500 days, we find a rate of planets per FGK star of <0.27 (84.13th percentil
402.
by Strilanc 7y ago
It's not limited to javascript: http://twistedoakstudios.com/blog/Post4428_unfathomable-bugs...
403.
by Strilanc 7y ago
Actually the bloom filter was just an approachable example. There are much more clever and space efficient solutions to this problem, such as HyperLogLog [1] (speculating purely based on the numbers in that article, it looks like a few mega
404.
by Strilanc 7y ago
How are you computing that number? It's definitely wrong. Assume Google receives 1 trillion queries per year, and has been around for 20 years. Using a bloom filter you can achieve a 1% error rate with ~10 bits per item. So a 200 terab
405.
by Strilanc 7y ago
Not a physicist, but in my mind the basic obstacle to superdeterminism is that in the initial state at t=0 you have O(S) degrees of freedom but throughout some chunk of spacetime there will be O(S * T) Bell violations (where 'S' i
406.
by Strilanc 7y ago
RSA with keys less than 1024 bits long is not considered to be secure against classical attack, so SSL/HTTPS is presumably not using such key lengths. The construction in the paper still takes hours on 1024 bits, therefore it will not
407.
by Strilanc 7y ago
I agree with all of that.
408.
by Strilanc 7y ago
See title of paper.
409.
by Strilanc 7y ago
I'm having a hard time parsing your question. Our goal in this paper was to better understand the resources required to factor with a quantum computer. These estimates can then be fed into decisions about the rate post-quantum cryptosy
410.
by Strilanc 7y ago
I don't really know a lot about D-wave to be honest. I defer to Scott Aaronson's posts [1] and to the opinion that the main criteria for success is "solve hard problems" as opposed to "solve hard problems with a qua
411.
by Strilanc 7y ago
Yes, the time scales quadratically in the key size while the space scales linearly (times a bit of logarithmic overhead on both). I think of the space as the limiting factor, since an attack that takes months to run is still worrying to cry
412.
by Strilanc 7y ago
I'm not an expert on the D-wave machine, but I think it's nowhere near meeting the 10^-3 physical gate error rate criteria specified by the paper. They don't even really divide the computation up into gates; it's an anne
413.
by Strilanc 7y ago
I'm one of the authors on this paper and can answer questions if people have some.
414.
by Strilanc 7y ago
The correctness of cryptographic voting systems is determined by their publicly observable behavior, not by their internal implementation. It's the protocol that's secure, not the specific hardware or software implementation. So t
415.
by Strilanc 7y ago
I can't access the study. How did they distinguish correlation with this event from the fifty billion other things that happened during March 2017? E.g. did they check if the people who committed suicide tended to have a netflix accoun
416.
by Strilanc 7y ago
That's schoolbook multiplication. It has quadratic complexity in the number of digits.
417.
by Strilanc 7y ago
The thing I'm describing doesn't allow the steps to run in parallel. In fact it prevents it, because each of the three recursive calls require exclusive access to overlapping regions of the output.
418.
by Strilanc 7y ago
It's not really tail recursion, it's just similar in that you get the recursion into a particular form in order to enable an optimization that avoids the need for intermediation. For tail recursion, that form is the last thing exe
419.
by Strilanc 7y ago
I wrote the paper that this article is describing [1], and can answer questions. The paper is probably more approachable than you think. Basically I rewrite code like `let intermediate_value = recursive_call(...)` into code like `output +=
420.
by Strilanc 7y ago
> Do you have an outline of this proof? Let p be the real number where, iff the k'th program halts, the k'th bit of p (after the decimal point, in binary) is 1. Let M be the operation "toggle a bit with probability p&quo

More ›