3 ms·

Hi Andrew - Have you explored holographic algorithms/encodings that use shape to represent elements such that you can succinctly and uniquely define an object/r

• deleted 11y ago
  [deleted]
• wolfgke 11y ago
  > Have you explored holographic algorithms/encodings[...] As far as the wording in mainstream science is, holographic algorithms are something entirely different, see https://en.wikipedia.org/wiki/Holographic_algorithm https://en.wikipedia.org/wiki/Holographic_algorithm.
  • espeed 11y ago
    Vladimir Kornyak touches on some of these ideas in these papers: 1. On Compatibility of Discrete Relations (2005) http://arxiv.org/pdf/math-ph/0504048.pdf http://arxiv.org/pdf/math-ph/0504048.pdf 2. Structural and Symmetry Analysis of Discrete Dynamical Systems (2010) http://arxiv.org/pdf/1006.1754.pdf http://arxiv.org/pdf/1006.1754.pdf 3. Discrete Dynamical Models: Combinatorics, Statistics and Continuum Approximations (2015) http://mmg.tversu.ru/images/publications/2015-vol3-n1/Kornyak-2015-01-05.pdf http://mmg.tversu.ru/images/publications/2015-vol3-n1/Kornya... On a somewhat related note -- applying quantum principles to graph database processing -- see this new paper by Marko Rodriguez (the creator of the Gremlin graph programming language): 4. Quantum Walks with Gremlin (2015) http://arxiv.org/pdf/1511.06278v1.pdf http://arxiv.org/pdf/1511.06278v1.pdf