So this week's topic gave a myriad of interesting things to cover for this post. I'll start with a bit of fascinating information. We've heard of bits, which normally store information as 0's or 1's; quantum bits, or qubits, can store information in quantum computers as | 0〉 and | 1〉 at the same time, using something called quantum superposition- where an electron in an atom can be both excited and at ground state at the same time, that is, until we observe it; then it will be in either | 0〉 or | 1〉 (ground state or excited, respectively). Apparently this can allow for much faster calculations, because each particular set of electron positions can correspond to a calculation, so one atom can do two at a time! Very different from classical computing, which only does one at a time. This was mentioned along with a wad of impenetrable jargon within various research articles.
As well, I found a site on Recursion, which explains the concepts in an applied sense. From what I understand, the simplification of the concept is as follows: calling a function within itself in order to break down and simplify the problem in some way such that after each recursive call it gets closer to the base case.
