\begin{definition}[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 {{AuthorRef|Alan Mathison Turing}}, {{AuthorRef|Alonzo Church}} and {{AuthorRef|Stephen Cole Kleene}}.
The term used by {{AuthorRef|Alonzo Church|Church}} when he discussed the issue in his how famous Church's Thesis was '''effectively calculable'''.
Category:Definitions/Mathematical Logic
\end{definition}