algorias

19 ms·

151.
by algorias 11y ago
It's just an exponential overhead. The state of a quantum computer is a superposition over all bitstrings, i.e. a vector of size 2^n for n qubits, and you have to implement quantum operators by multiplying with 2^n x 2^n unitary matric
152.
by algorias 11y ago
According to that criterion, no one should comment on HN ever, unless they are writing at the level of a peer reviewed journal. I supposed it would be interesting for people here for me to at least point out some obvious red flags.
153.
by algorias 11y ago
[Note: I am a master student doing my thesis in this area] Ok, I'm going to go out on a limb here and call bullshit, based on the meta-reason that they cite a paper of theirs which already claims to show that NP is contained in BQP usi
154.
by algorias 11y ago
I agree with your points, but I'm not flagging it as I feel the resulting comments are actually quite good, and are pushing forwards the ongoing discussion about civility, assumption of good faith, etc.
155.
by algorias 12y ago
That's a good point! But your proposed solution is security by obscurity. What if a rogue employee trained a backdoor into your DNN? What if the NSA asked vendors for a master key? The purpose of this research is to work as a proof of
156.
by algorias 12y ago
We're talking about human lives here. You can't restore from backup when you make a mistake. My god, what arrogance.
157.
by algorias 12y ago
Hmm, I'm a bit surprised that some sort of ad-hoc AI is used, instead of extracting the topology of the level and running a pathfinding algorithm on it. Once you remove all the human-confusing effects, the levels are actually very simp
158.
by algorias 12y ago
Yes, they rely on other people's wires, namely the ones rented (i.e. paid for) by the consumers of their products. How do you justify double dipping in this case?
159.
by algorias 12y ago
I see where you're coming from, and I agree with you in large part, specially about making your assumptions explicit. However, I think it's important to notice that an explicit formula for your thought processes can be difficult (
160.
by algorias 12y ago
> The fact is that to make a good decision, eventually you need to compute a single number. Your linked blog post states that if you make a good decision, then there is a process computing a single number which is equivalent to your proc
161.
by algorias 12y ago
Your intuition is good, but pi is a bad example. There are ways to represent specific irrational numbers such as pi, e.g. a turing machine generating all its digits. For most numbers in R that isn't possible, however. The exceptions ar
162.
by algorias 12y ago
Well, in math some things are true but not provable unless our formal system is inconsistent. This is one of Gödel's incompleteness theorems. It's therefore not far fetched that some algorithms might in fact always work correctly,
163.
by algorias 12y ago
Why not? They get a commission. Banks issue close similar deals (letters of credit) all the time for single-container shipments in international trade. A 20K transaction is certainly not below their notice, they have entire departments spec
164.
by algorias 12y ago
As you get older, it becomes a better idea to be one of the three guys rather than working for them.
165.
by algorias 12y ago
Seven held a short seminar about it, it's the first one in this video: http://www.youtube.com/watch?v=DQ8eB_FORLo
166.
by algorias 12y ago
Well, for very small intros (4k/8k) distance fields are still hard to beat due to their compactness. A couple of examples not based on distfields, off the top of my head: http://www.pouet.net/prod.php?which=62027 (No i
167.
by algorias 12y ago
Ah, the classic presentation that got me started in the demoscene a couple of years back. The Google cache version of the pdf doesn't include any images, so I put up a copy over here: https://dl.dropboxusercontent.com/u
168.
by algorias 12y ago
> I imagined every container to have tracking and identification numbers so the owners could know roughly where it is at all times; and so that various government agencies could prevent import of things not allowed in their countries. Ye
169.
by algorias 12y ago
> At best, governments already take the "pulse" of public and expert opinion when setting policy, making referendums futile or redundant. So you're saying a referendum is futile because it forces the government to (preempt
170.
by algorias 12y ago
That 20x is hardly just because of numpy overhead, read the answer more carefully: > optimization by precomputing F values > I also optimize by skipping the rest of the convolution if the first result isn't zero. If you don'
171.
by algorias 12y ago
This is a project of Microsoft Research. It's purely academic at this point (done in collaboration with ETH Zürich), and at this stage it has nothing to do with the commercial side of the company, except being funded by them. Apple fla
172.
by algorias 13y ago
It's clear that being anxious had survival value at some point of our evolutionary history. This is not necessarily the case anymore. In fact, I predict that the drawbacks of anxiety will put negative selective pressure on it, comple
173.
by algorias 13y ago
Seeing the numbers like that does make me realize what a huge deal this was. I hope this will be the start of a movement truly bringing positive change. I wish there was something meaningful for me to do, as a non-american, to help this cam
174.
by algorias 13y ago
This is not an original idea by any means; it's called the Church-Turing thesis, and has been around for 50+ years. As for your question "what are those limits?": In a nutshell, no computer program can ever fully answer quest
175.
by algorias 13y ago
Yes you have a constant number of states at your disposal. Otherwise, there is a trivial solution that takes n or so time, matching the theoretical lower bound (imposed by the "speed of light" for information propagation in this
176.
by algorias 13y ago
nkurz, you are hellbanned. Can't see why, given that your account is clearly legitimate.
177.
by algorias 13y ago
To expand on 2. above: It's a common misconception that the class NP is important because it stands for hard problems, but in fact there are classes of hard problems which we know to be distinct from P. Specifically, P != EXPTIME (see
178.
by algorias 13y ago
(Devils Advocate) What about this: seeing the house has no lock, opening the door, going inside, counting the money in the owners wallet, putting it back, then reporting that "Anyone could steal $300 from that guy".
179.
by algorias 13y ago
> When people program, they (usually) don't do math. And that's it. I disagree. Whenever you implement an algorithm, you build a proof of correctness in your mind. If you reasoned about your program and are convinced that it ha
180.
by algorias 13y ago
It's required to match all such x, otherwise the empty regex "" trivially satisfies the requirement.

More ›