Definition:Algorithmic Computability

The concept of algorithmic computability is an intuitive one.

An algorithmically computable function is a function which can be carried by means of an algorithm, theoretically by a person using pencil and paper.

The concept arose in the decades before the invention of digital computers. Much of the theoretical groundwork was done in the 1930s by such as Alan Turing, Alonzo Church and Stephen Kleene.

The term used by Church when he discussed the issue in his how famous Church's Thesis was effectively calculable.