Viewing profile — urgoroger
urgoroger
HN member- Joined
- Mon, Nov 27, 2017, 6:21 AM UTC
- HN karma
- 78
- Public activity
- 15 items
- HN profile
- View on Hacker News ↗
About urgoroger
No profile information was provided.
Recent public activity
-
comment
Comment #19480378
What I was trying to communicate was that the Turing machine believed to represent the limits of what is physically possible. So then you have turing machines >= brain (since a bra…
-
comment
Comment #19480067
In accordance with the Church-Turing thesis, the Turing machine stands to be capable of doing anything that should be called computation. It follows that if the brain is capable of…
-
comment
Comment #18676455
I think the commentor's point is that measurement (which is a key component of quantum computation) is not a unitary operation.
-
comment
Comment #18550579
It might be easier to view entropy of a state as sort of the probability that that state would occur after randomly arranging all of its parts (usually particles). In fact this is …
-
comment
Comment #16094254
Yes, this is pretty much the basis to quantum key distribution protocols, and probably one of the first studied uses of quantum information in general. Consider BB84 ( http://www.c…
-
comment
Comment #16032533
I want to add that quantum FFT performs the transform on the amplitudes in the n-qubit state. Thus its output is an n-qubit state with the amplitudes matching the fourier tranforms…
-
comment
Comment #16032116
I think you have the right idea but the wrong terminology. A n qubit system requires amplitudes (probabilities) for all 2^n possible basis states. For example, the representation w…
-
comment
Comment #16019121
That's correct. Given a polynomial time approximate algorithm for Ek-SAT (note, by approximate algorithm I mean along the lines of the formal definition of approximate algorithm, t…
-
comment
Comment #16018889
While I agree with you, you should note that even approximation within any degree of error is NP-complete for a large class of NP-complete problems (e.g. TSP, and the problem MAX-E…
-
comment
Comment #15900031
Don't worry! I study quantum computation, and I didn't notice that the |> was supposed to be a D to form the word LIQUID!
-
comment
Comment #15822904
Could be wrong too, ML is not my field. Basically, a generator neural network has two things which affect its output: an input and some parameters (weights). Let's use the setting …
-
comment
Comment #15822813
x is actually the generated image they are testing against x0. A lower E(x; x0) means an image which fits well towards the objective based on the original image (depends on the tas…
-
comment
Comment #15805643
This is correct, and I think it's mentioned in the article. I think this is probably what most people would think of too rather than the heap based solution. Using the heap solutio…
-
comment
Comment #15785385
There are a two cases: BQP contains something BPP doesn't: Then the thesis is false as long as we can realize a quantum computer, as then there exists something which can be solved…
-
comment
Comment #15785347
While it is true that compatibility should remain intact, this comment seems to misunderstand what the STRONG Church-Turing thesis purports (EDIT: at least the one Google is probab…