Before a machine such as a computer can perform a task, an algorithm for performing that task must be discovered and represented in a form that is compatible with the machine. A representation of an algorithm is called a program. A program usually displayed on computer screens. What you see on the screen does not necessarily what happened on the background, programs are encoded in a manner compatible with the technology of the machine. The process of developing program, encoding it in machine-compatible form, and inserting it into a machine is called programming. Programs, and the algorithms they represent, are collectively referred to as software, the machinery itself called hardware.

An algorithm to cook rice

Final result : Easy, Quick, Healthy, Inexpensive Tasty Rice

Steps:

Step 1. Rinse the rice. Rinse until the water is clear and not cloudy.

Step 2. Combine long grain rice and water. For every cup of long grain rice, add 1 1/2 cups water.

Step 3. Boil the Rice. Bring the rice to a boil, uncovered, at medium heat.

Step 4. When the rice is boiling, turn the heat down to medium low. Place the lid on the pot, tilting it to allow steam to escape.

Step 5. After the rice has been cooking for a few minutes, check for holes or “craters”.

Step 6. When you can see the holes or crater, put the lid on tight. Turn the heat down to low.

Step 7. Simmer the covered rice for another 15 minutes. Fluff it up with a fork and serve hot.

Now, the rice ready to serve. Final result achieved.

The study of algorithm began as a subject in mathematics’. Indeed, the search for algorithm was a significant activity if mathematician long before the development of today’s computers. The goal was to find a single set of directions that described how all problems of a particular type could be solved. One of the best known examples of this early research is the long division algorithm for finding the quotient of two multiple-digit numbers. Another example is the Euclidian algorithm, discovered by the ancient Greek mathematician Euclid, for finding the greatest common divisor of two positive integers.

The Euclidian Algorithm for Finding the Greatest Common Divisor of two positive integers

Description : This algorithm, assumes that its input consists of two positive integers and proceeds to compute the greatest common divisor of these two values.

Procedure:

Step 1. Assign X and Y the value of the larger and smaller of the two input values, respectively.

Step 2. Divide X and Y, and call the remainder N.

Step 3. If N is not 0, then assign X the return value of Y, assign Y the value of N, and return to step 2; otherwise, the greatest common divisor is the value currently assigned to Y.

Once an algorithm for performing a task has been found, the performance of that task no longer requires an understanding of the principles on which the algorithm is based. Instead, the performance of the task is reduced to the process merely following directions. It is through this ability to capture and convey intelligence by means of algorithms that we are able to build machines that perform useful tasks. Consequently, the level of intelligence displayed by machines is limited by the intelligence that can be conveyed through algorithms. We can construct a machine to perform a task only if an algorithm exists for performing that task.In turn, if no algorithm exists for solving a problem, then the solution of that problem lies beyond the capability of machines.

Indentifying the limitation of algorithmic capabilities solidified as a subject in mathematics in the 1930s with the publication of Kurt Gödel’s incompleteness Theorem. This Theorem essentially states that in any mathematical theory encompassing our traditional arithmetic systems, there are statements whose truth or falseness cannot be established by algorithmic means. In short, any complete study of our arithmetic systems lies beyond the capabilities of algorithm activities.

This realization shook the foundation of mathematics, and the study of algorithmic capabilities that ensued was the beginning of the field known today as Computer Science. Indeed, it is the study of algorithms that forms the core of Computer Science.

Related posts:

1. The Science of Algorithms
2. Introduction to Computer Science and this website
3. Computer Science Course

1. Data Storage
   In this subject, we consider topics associated with data representation and the storage of data within a computer. The types of data we will consider including text, numeric values, images, audio, and video.
2. Data Manipulation
   In this subject we will learn how a computers manipulates data and communicates with peripheral devices such as printers and keyboards. By learning this subject you can learn the basics of computer architecture and learn how computers are programmed by means of encoded instructions, called machine language instructions.
3. Operating Systems
   In this subject we study operating systems, which are software packages that coordinate a computer’s internal activities as well as oversee its communication with the  outside world. It is a computer’s operating system that transforms the computer hardware into a useful tool. The goal learning this subject is to understand what operating systems do and how they do it. Such a background is central to being an enlightened computer user.
4. Networking and the Internet
   In this subject we fill find out the area of computer science known as networking, which encompasses the study of how computers can be linked together to share information and resources. We also going to study construction and operation of networks, applications of networks, and security issues. As a study case we going to use worldwide network knows as the internet.
5. Algorithms
   As we study Computer Science we will learned that the central theme of Computer Science is the study of algorithms. When we reach this subjects it’s time for us to focus on this core topic. Our goal is to explore enough of this foundational material so that we can truly understand and appreciate the science of computing.
6. Programming Languages
   In this subjects we study programming languages. We’re not going to learn all programming languages, that exist in universe. Rather than we going to learn about programming languages. Although I’ll put some programming languages example later on, our goal is to appreciate the commonality as well as the diversity among programming languages and their associated methodologies.
7. Software Engineering
   In this subjects we explore the problems that are encountered during the development of large, complex software systems. The subjects is called Software Engineering because software development is an engineering process. The goal of researchers in software engineering is to find principles that guide the software development process and lead to efficient, reliable software products.
8. Data Abstractions
   This subject will investigate how data arrangements other than the cell-by-cell organization provided by a computer’s main memory can be simulated – a subject known as data structures. The goal is to allow the data’s user to access collections of data as abstract tools rather than force the user to think in terms of the computer’s main memory organization. We will study how to construct such abstract tools to the concept of objects and object-oriented programming.
9. Database Systems
   A database is a systems that converts a large collection of data into an abstract tool, allowing users to search for and extract pertinent items of information in a manner that is convenient to the user. In this chapter we explore this subject as well as take side excursions into the related fields of data mining, which seeks techniques for uncovering hidden patterns in large data collections, and traditional file structures, which provide many of the underlying today’s database and data mining systems. 
10. Computer Graphics
    Computer Graphics is the branch of computer science that applies computer technology to produce and manipulate visual representations. We going to explore a filed that is having major impact in the production of motion picture and interactive video games.
11. Artificial Intelligence
    In this subject we explore the branch of computer science known as artificial intelligence. Although this field is relatively young, it has produced some astonishing breakthrough such as expert chess players, computer that appear to learn and reason, and machines that coordinate their activities a common goal. In Artificial Intelligence, everything that seems Science Fiction today’s may be reality for tomorrow’s.
12. Theory of Computation
    This subject we will consider the theoretical foundations of computer science. In a sense, it is the material in this subject that gives computer science the status of a true science. Although somewhat abstract in nature, this body of knowledge has many very practical application. In particular, we will explore its implications regarding the power of programming languages and see how it leads to a public key encryption system that is widely used in communication over the internet.

Related posts:

1. Introduction to Computer Science and this website
2. The Science of Algorithms
3. Abstraction