Definition:Algorithmic Computability

This page has been identified as a candidate for refactoring of advanced complexity. In particular: This needs to be tightened up: the historical material into a historical note, for a start. Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Definition

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 Mathison Turing, Alonzo Church and Stephen Cole Kleene.

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

Sources

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.