# Answer to Question #44899 in C for name

Question #44899
define algorithm
1
2014-08-13T10:55:11-0400
In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning.

An algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing &quot;output&quot; and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Over the last 200 years the definition of algorithm has become more complicated and detailed as researchers have tried to pin down the term. Indeed there may be more than one type of &quot;algorithm&quot;. But most agree that algorithm has something to do with defining generalized processes for the creation of &quot;output&quot; integers from other &quot;input&quot; integers &ndash; &quot;input parameters&quot; arbitrary and infinite in extent, or limited in extent but still variable&mdash;by the manipulation of distinguishable symbols (counting numbers) with finite collections of rules that a person can perform with paper and pencil.

The most common number-manipulation schemes&mdash;both in formal mathematics and in routine life&mdash;are: (1) the recursive functions calculated by a person with paper and pencil, and (2) the Turing machine or its Turing equivalents&mdash;the primitive register machine or &quot;counter machine&quot; model, the Random Access Machine model (RAM), the Random access stored program machine model (RASP) and its functional equivalent &quot;the computer&quot;.

When we are doing &quot;arithmetic&quot; we are really calculating by the use of &quot;recursive functions&quot; in the shorthand algorithms we learned in grade-school, for example, adding and subtracting.

The proofs that every &quot;recursive function&quot; we can calculate by hand we can compute by machine and vice versa&mdash;note the usage of the words calculate versus compute&mdash;is remarkable. But this equivalence together with the thesis (hypothesis, unproven assertion) that this includes every calculation/computation indicates why so much emphasis has been placed upon the use of Turing-equivalent machines in the definition of specific algorithms, and why the definition of &quot;algorithm&quot; itself often refers back to &quot;the Turing machine&quot;. This is discussed in more detail under Stephen Kleene&#039;s characterization.

The following are summaries of the more famous characterizations (Kleene, Markov, Knuth) together with those that introduce novel elements&mdash;elements that further expand the definition or contribute to a more precise definition.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!