Theory And

Algorithms

 

Algorithms are considered as the methods which the computer does certain tasks. It is a mathematical process which is often used for simple and large calculations. There are other types of Algorithms which consider logics and randomness.

Algorithms are like a series of instructions which are input to machines to in order for them to carry out those certain tasks. The use of algorithms is broad. Algorithmic instructions are used all around us. The watch we wear contains a series of algorithms. The computers we use are full of algorithmic instructions. "Algorithms are used throughout modern life for the benefit of mankind whether as instructions in special programs to help disabled people, computer instructions in the cars we drive or the specific steps in any calculation. The technologies that they are employed in have helped save lives and also make our world more comfortable to live it".

 

 

From the diagram above we can see that a series of questions is being asked when a lamp doesn’t work. The algorithms part of this graph asks a question and gives a reasonable solution for that problem. For example, it’s the lamp is not plugged in, you obviously need to plug a new lap. However, if the lamp is plugged in, a new series of algorithms or instructions is going to be processed. This process consists taking a new route of solutions. If the bulb is placed, but is still not working, the new instructions ask weather the bulb is burned or not. Therefore, new solutions appear if a yes or no is given. For example, weather or not to replace the bulb. If not, than a new bulb must be bought.

The theory of computation deals with how efficiently problems, mathematically can be resolved. They are other means to resolve certain problems in either a more efficient way, or simpler way.

There are two types of theories, the computability theory and the complexity theory.

"Computability theory deals primarily with the question of whether a problem is solvable at all on a computer"

"Complexity theory considers not only whether a problem can be solved at all on a computer, but also how efficiently the problem can be solved. Two major aspects are considered: time complexity and space complexity, which are respectively how many steps does it take to perform a computation, and how much memory is required to perform that computation."

 

 

Questions-

How was algorethims developed?

Are there different types of algorethims?

How, in the future, can algorethims develop?

 

 

 

 

Reference:

http://en.wikipedia.org/wiki/Algorithm

http://www.cs4fn.org/history/darkhistory.php

http://en.wikipedia.org/wiki/Theory_of_computation