<p>It seems to me that </p>

<ul>
<li>All/any algorithm(s) evolve based on what's feasible on a machine. This is captured within its instruction set.</li>
<li>By Analogy data structures are closely associated with physical layout of memory hierarchy on a machine including addressing schemes</li>
</ul>

<p>Is there a non-formal(with/without math) description of the above dependencies in the form of a set of programming experiments with different instruction sets, memory hierarchies and how they impact design of data structures and algorithms that follow? </p>

<p>Few links that I got :</p>

<ul>
<li>a paper on "Data Structures in Classical and Quantum Computing"</li>
<li><a href="http://rads.stackoverflow.com/amzn/click/0262640686" rel="nofollow">Elements of computing systems</a>: Building a modern computer from first principles</li>
</ul>

<p>(PS: Not thinking of expanding the scope to distributed and/or parallel processing systems)</p>

CC BY-SA 3.0
2015-07-13T18:13:18.140Z
Hello, I am not sure I understand your question. You mean if there is a description on a different computational model? If that is the question, then yes there are a number of different models; quantum computing is one of them, but there are others as well. The main reason why these models try to mimic real architectures and system capabilities is that we want to be able to run these algorithms. I guess you could argue about completely hypothetical models, but what would the benefit of those be?
Konstantinos Koiliaris
CC BY-SA 3.0
2015-07-13T20:26:27.527Z
Thanks @KXK . My question was to seek if there was any programming experiments done for a specific problem ex: quicksort on arrays in classical computing is equivalent to some other algorithm with a different data structure in quantum computing.
sandeepkunkunuru
CC BY-SA 3.0
2015-07-13T20:30:52.083Z
Ok, I am afraid that what you are asking is still not well defined. For starters what is your definition of equivalence in the above context? Moreover, you do know we don't - currently - have quantum computers - of any decent computational power anyway - to run programming experiments on right?
Konstantinos Koiliaris
<ds.algorithms><memory>
Dependency of Algorithms, Data structures on Instruction sets ex: Classical vs Quantum computing
sandeepkunkunuru
# Dependency of Algorithms, Data structures on Instruction sets ex: Classical vs Quantum computing

(Asked by: username_0 on 2015-07-13)

It seems to me that

* All/any algorithm(s) evolve based on what's feasible on a machine. This is captured within its instruction set.
* By Analogy data structures are closely associated with physical layout of memory hierarchy on a machine including addressing schemes

Is there a non-formal(with/without math) description of the above dependencies in the form of a set of programming experiments with different instruction sets, memory hierarchies and how they impact design of data structures and algorithms that follow?

Few links that I got :

* a paper on "Data Structures in Classical and Quantum Computing"
* [Elements of computing systems](http://rads.stackoverflow.com/amzn/click/0262640686): Building a modern computer from first principles

(PS: Not thinking of expanding the scope to distributed and/or parallel processing systems)

**Tags:** ds.algorithms, memory
> **Comments:**
> **username_1**: Hello, I am not sure I understand your question. You mean if there is a description on a different computational model? If that is the question, then yes there are a number of different models; quantum computing is one of them, but there are others as well. The main reason why these models try to mimic real architectures and system capabilities is that we want to be able to run these algorithms. I guess you could argue about completely hypothetical models, but what would the benefit of those be?  
> **username_0**: Thanks @KXK . My question was to seek if there was any programming experiments done for a specific problem ex: quicksort on arrays in classical computing is equivalent to some other algorithm with a different data structure in quantum computing.  
> **username_1**: Ok, I am afraid that what you are asking is still not well defined. For starters what is your definition of equivalence in the above context? Moreover, you do know we don't - currently - have quantum computers - of any decent computational power anyway - to run programming experiments on right?  

---

## 0 answers

