In class, we discussed the Computability capabilities of modern computers. Although they are exponentially more efficient than their 40-year old counterparts, computers still struggle what can be computable. One way to approach this issue is to improve the amount of steps that an algorithm takes to sort or search through a list. For example, a linear search requires an n amount of steps to achieve while a binary search requires a log2n steps. With lists containing thousands of elements, binary search makes the difference between ten steps to thousands of steps for linear search. Apart from the efficiency of an algorithm, there is also another component that saves time and money: circuits. Seven decades ago, computers consisted of moving parts, such as vacuum tubes, to calculate mathematical functions. It all changed once transistors were used to compute. Unlike physical components that turn on and off, transistors are small, efficient, and do not generate as much heat. Compared to the 1980’s, a problem that required months to solve is now solvable in minutes. This revolutionary discovery sparked the birth of the Digital Age. This is an improvement, but is there an even faster method of computing? With  the help of physicist and their knowledge of Quantum Mechanics, computers can work at unbelievable speeds using Quantum Computing.

In Quantum Computing (closely linked to quantum mechanics), quantum bits (or ‘qubits’) can simultaneously hold values of 1, 0, or both, rather than being set to 1 or 0 as traditional electronic bits are. This way, one qubits can hold the same information as 3 bits. As good as it sounds, quantum computing is still in its infancy since Quantum Computers are large machines that are somewhat unreliable and not yet very powerful. Regardless of the current struggles for these computers, large technology companies, such as Google and Nasa, are experimenting and building the first quantum computers. For example, Google strives for the future of computing and proclaims that their “D-Wave 2X quantum computing machine has been figuring out algorithms at 100,000,000 times the speed that a traditional computer chip can”. Although the product is not available to the public, such efforts are a great step forward for the future of computing.

So, if Quantum Computers are still in their infancy, then why should we care so much about them? In the best scenario, they have the potential to blow right through obstacles that limit the power of classical computers, solving problems in seconds that would take a classical computer the entire life of the Universe just to attempt to solve, like encryption, optimization, and other similar tasks. They are powerful, but things can go wrong if they are used for unethical reason such as online theft and security breaching. In the Digital Age, it is crucial to promote the application of Quantum Computers along with their ethical implications. Without the proper education, Quantum Computing can be a step forward for scientific research or a step backwards for the world economy.

Social network services (SNS) such as Facebook and Twitter have a huge impact on society. SNS influenced politics, economics and our daily lives in every world. There are some countries in Europe that succeeded democratizing and SNS helped the processes. In Moldova, it cannot be denied that SNS helped to gather the crowd and fueled the flames of protests. More than 900,000 people gathered through a Twitter hashtag, but as soon as the government blocked the internet, they lost what to do and the will to fight. Two issues arose in my after reading the article.

First, should the government censure any stuff in SNS? I think there need to be some regulations to prevent sexual abuse, violence and any inhumane discriminations. However, the problem is that once the public gives the government a power to control the internet and SNS, they can do something other than what they were supposed to do in specific occasions like political protests.

Secondly, I realized that people have been overlooked the blind spot of the internet and SNS. What happens if we don’t have access to them and if this is intentional by some parties? This sounds unlikely, but it is a point to think about. People hugely rely on computers, internets and SNS, and they are definitely helpful. But at the same time, we need to know that they also have some limits. They are not something operated automatically, but instead, they are controlled and managed by someone with intentions. In the article we read, Moldovans did not know how to keep protests when the internet was blocked.

In class today, we covered the current Complexity and Computability for Computers.These concepts are essential to Computer Science because the process of writing algorithms is not limited to writing correct syntax. In fact, that is the first step for programmers. Once the programmer understands the syntax for a language, he or she must then research how much money and time an algorithm requires because every additional bit costs a lot for storage. These questions are not covered in introductory programming, but they make the difference between writing a program to count apples to finding the fastest route between points. Although Graph Theory solves this problem, there is plenty of real life applications, from walking between classes in college to how Google Maps gives you the fastest route to your destination. So, how is one algorithm better than the other? Well, one algorithm is considered better if it takes less steps to complete.

In the context of our class, we covered two sorting algorithms: Insertion and Merge. Insertion takes n^2 number of steps to complete while Merge takes n*log2n steps to complete, n being the size of the list. Through these examples, it is clear that Merge sorting is better than Insertion. However, is it the best? Well, not really. At the end of the day though, whatever the best sorting algorithm really is depends on the input (and who you ask). There is an algorithm known as Quicksort which can take less steps than Merge steps. The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case. Let’s discover how they compare:

Like Merge sort, quick sort works like a recursive procedure (a function that calls itself). The key to understanding this algorithm is to think of it as a pivot. Without going into too much detail, this is how it works: the goal is to rearrange the array such that all all elements less than the pivot are to its left, and all elements greater than the pivot are to its right. Sounds simple, but how to do it will take me pages. Regardless, the important distinction is storage. Why quicksort is better than mergesort ? Quick sort is an in-place sorting algorithm. In-place sorting means no additional storage space is needed to perform sorting. Merge sort requires a temporary array to merge the sorted arrays and hence it is not in-place giving Quick sort the advantage of space. Like I mentioned before, more storage equals more money. So, in terms of price and speed, Quicksort outperforms Merge Sort.

That was a lot of information, so what’s the importance? Well, the problem lies when programmers that are only taught syntax never consider storage cost and processing power. Unless we do something about it, potentially billions of dollars are at stake for storing the large quantities of information from the Digital Age. To further the conservation, here are some additional questions to build upon: can we build faster and cheaper sorting algorithms? If so, how? Is there ethical implications of storing and sorting so much information at a faster rate? How can we assure that all programmers understand the implications of writing code?