>>> 1.02**365
1377.4082919660768
>>> 1.021**365
1969.6808462403098
>>>1,942 karma · joined July 21, 2009
>>> 1.02**365
1377.4082919660768
>>> 1.021**365
1969.6808462403098
>>>1) A quantum computer uses computational gates to very deliberately orchestrate interference patterns. This is the reason quantum computers are faster than classical ones at certain problems.
2) On top of (1), there's a ton of undesired interference because of dirty real-world constraints. Quantum computers are not fully isolated from their environment, and executing a gate cannot be done without also affecting qubits that are not supposed to be part of the gate.
> subject to bias due to quantum interference, which they check by solving the path integral in classical simulation
This is an instance of (1)
> because quantum interference is EXACTLY WHY WE CAN’T USE CURRENT QUANTUM PROCESSORS TO “BREAK ALL CRYPTO” IN THE FIRST PLACE BECAUSE WE CANNOT DO EFFICIENT QUANTUM ERROR CORRECTING CODES
This is an instance of (2).
Quantum supremacy is all about showing that you can implement (1) with enough fidelity even in the presence of (2). Now keep this in mind while reading the rant again, and you'll quickly realize it's absolute nonsense.
Climate is like your budget. There's a lot of factors flowing into it, and even a very small change (e.g. 0.1% additional water vapor) can flip the sign on the total balance. Sorry, but your argument about the magnitude of the problem is just wrong.
By the way, my neutral explanation above doesn't mean that I approve of doing such things. Honestly, I'm quite torn about the issue.
"Dwarf tossing is an activity in which a large person throws a small person. The venue often is one in which alcohol is served. It is often a source of livelihood for the small person, with the large person paying for the privilege. While dwarf-tossing is legal in many places, it is sometimes banned by law."
I know that it's frustrating when even scientists sometimes act with naive recklessness. A prime example is when people in the social sciences or economics don't think about individuals' incentives enough. But in this case I doubt that the people in question are unaware of the risk of overshooting their target.
https://www.geo.admin.ch/en/geo-information-switzerland/geod...
https://www.geo.admin.ch/en/geo-information-switzerland/geod...
You can also visualize a lot of the topographic data on map.geo.admin.ch, which is surprisingly useful/flexible, if not very user friendly.
So yeah, the advice is very nuts and bolts, and several of the points don't make any sense without that context (e.g. picking the low-hanging fruits). It's assumed that the reader is already highly motivated to have an impactful altruistic career, and that this motivation is a primary source of self-fulfillment.
Just pointing this out because there seems to be a bit of confusion in the comments here.
Sorry, but this is a non-sequitur. In order to find (by enumeration) the shortest program producing a certain output, you absolutely do need to know when you're done, and thus you do need to solve the halting problem.
Um, the decision version of TSP (does there exist a Hamilton path of length at most x?) is definitely in NP. It is also NP-hard (your definition of NP-hardness is wrong).
I guess what you're trying to say is that the optimization version of TSP (find the shortest Hamilton path) cannot be verified in polynomial time, as this would require answering the decision version of TSP in the negative for some length x, and this is hard to verify since TSP is not in co-NP.
In spirit, your comment is absolutely spot on. But as we all know, technically correct is the best kind of correct :)
This is not correct. It's very obvious that all-pair similarity search can be solved in O(n^2) calls to the similarity metric, as stated in the readme. So unless the metric itself falls outside P, this problem is easy (but still hard to scale up in practice, of course)
It's amazing how medicine has advanced: We can now cure illnesses with very minimal amount of invasiveness required in most cases. Even before this news, open surgery was already mostly supplanted by laparoscopy, which involves only a few tiny cuts.
Um, what? That's exactly why these things end up in so many models.
> (there are plenty of better ways to simplify economic models).
Such as?
I like color-coded height maps, they can give you an intuitive feel for how a city lies on top of its terrain. It's very hard to make out moderate slopes though, e.g. if the city has high hills. I would most prefer a color-coded map showing the gradient.
Incidentally, if anyone has pointers to where this kind of map could be obtained (mostly for european cities in my case, but any resource would be helpful), I would appreciate it. Right now, I just try my luck with google when visiting a new city.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
0 1 0 2 0 1 0 3 0 1 0 2 0 1 0A solver for e.g. 3-SAT is general only in a very narrow sense, namely that an entire class of problems can be reduced to the specific problem it solves. However, the solver itself is not doing the reducing, rather it is being spoon-fed instances generated by somebody, and that somebody is doing all the hard work of actually thinking. The solver is just doing a series of dumb steps very quickly, with lots of heuristics thrown in. How is that not also "system 1"?
Anyway, the whole thing was just a fancy way of saying that you can either solve problems exactly, in the way that complexity theorists and algorithm designers do things, or statistically, in the way that learning theorists do things. No need to superimpose a strained analogy.
Note that analogously, a cube in 3 dimensional space is always considered to be 3 dimensional.
I also have some permanent health issues (not as serious as yours probably, but still) and I totally get the frustration of people applying wishful thinking to your situation without having any experience with the kinds of problems you're facing (as is happening in this thread).
I know it's not what you asked for, but feel free to drop me a line anytime if you need to talk to someone who has at least a slight chance of getting it. I can be reached on gmail under the same username.
For all I know, SJG picked a cool sounding word a 16 year old would like, e.g. SHARK, and it just happened to be an actual code word.