4 ms·
Take this with a grain of salt, because I'll admit I didn't read it very thoroughly. My understanding of holographic algorithms is that they make a primitive ou
by greendestiny 19y ago
Take this with a grain of salt, because I'll admit I didn't read it very thoroughly. My understanding of holographic algorithms is that they make a primitive out of a matching algorithms that could be executed in constant physical time with holographic storage. While thats great, I think it only fair to include the complexity of the matching in the overall algorithms complexity, because although it happens in constant time this only because of massively parallel interactions in the storage.
Still I think when the author says that P != NP proofs will have to address this I think he's right that that is important. It means that this is at the crux of the issue, either way it goes.
- amichail 19y agoMy understanding of holographic algorithms is that they make a primitive out of a matching algorithms that could be executed in constant physical time with holographic storage. Actually, from what I understand, that's not the point at all! What is "holographic storage" btw?
- greendestiny 19y agohttp://en.wikipedia.org/wiki/Holographic_data_storage http://en.wikipedia.org/wiki/Holographic_data_storage The whole point being that the reference signal can be projected into the storage and match found in a single pulse. Holographic algorithms deal generally with algorithms based on interference, so they might not directly relate to a physical storage device but the principles are similar.
- amichail 19y agoThe point is that this paper is about algorithms for classical (e.g., not quantum or anything special) computers. That's why it is so interesting -- it's kind of like quantum algorithms but will work with standard computers.