# An Algorithm : View of an amateur

I was searching for an answer to “What is an algorithm?”. But I could not find an exact answer for what I was looking for. There are various views on the definition of an “algorithm”. Going through some most common conception I concluded a definition to clarify what is an algorithm (still open to adjustments).

“Concise and precise, finite number of steps that can perform by a Turing machine (computer) effectively”

I used Knuth’s list of 5 properties that are widely accepted as the requirements of an algorithm which are finiteness, definiteness, input, output, effectiveness. [1]

Minsky[2], Savage and Gurevich[3] assert the thesis that “an algorithm can be considered to be any sequence of operations that can be simulated by a Turing-complete system”.

Thomas H. Cormen simply describe an algorithm in his book Algorithm Unlocked[4] as:

.. computer algorithm is a set of steps to accomplish a task that is described precisely enough that a computer can run it.

References:

[1]Knuth 1968, 1973

[2]Minsky 1967

[3]Gurevich 2000

[4]Cormen, Thomas H. (2013)

Like what you read? Give Dulaj Chathuranga a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.