Algorithm

History Of Algorithm

Nowadays every person uses the word “Algorithm” as a matter of course, but for the most the exact definition is a mystery. The intention of this site is to get into the secrets of this mystery and become acquainted with the culprits of this nomenclature. The focus is not on the state of the art implementation of specific algorithms but on interesting stories and the involved individuals. Beside the history of the name we will point out the methodological aspects of algorithmic work and the different programming techniques. In our investigation we will try to summarize and to give an impression of the historical dimension of algorithms. The Babylonian-Sumer-Method of extracting a root, one of the first documented examples of mathematical algorithms, and names like “Euklid” or “al-Khwarizmi” will not be secrets any more. Algorithm related in mathematics and computing.It is an finite sequence of instruction, an explicit, step-by-step procedure for solving problem, often used for calculation and data processing.It is an effective method in which a list of well-defined instruction for completing a task, or problems solution. A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability (Kleene 1943:274) or "effective method" (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo church's lambda calculuus of 1936,Emil Post's ""Formulation 1" of 1936, and Alan Turing's Turing MAchines of 1936–7 and 1939.

-Link-

Referens:
-History of Algorithm,http://cs-exhibitions.uni-klu.ac.at/index.php?id=193
-Wikipedia,http://en.wikipedia.org/wiki/Algorithm