Formal Statement
In first-order theories such as HA, which cannot quantify over functions directly, CT is stated as an axiom schema which says that any definable function is computable, using Kleene's T predicate to define computability. For each formula φ(x,y) of two variables, the schema includes the axiom
This axiom asserts that, if for every x there is a y satisfying φ then there is in fact an e which is the Gödel number of a general recursive function that will, for every x, produce such a y satisfying the formula.
In higher-order systems that can quantify over functions directly, CT can be stated as a single axiom which says that every function from the natural numbers to the natural numbers is computable.
Read more about this topic: Church's Thesis (constructive Mathematics)
Famous quotes containing the words formal and/or statement:
“The bed is now as public as the dinner table and governed by the same rules of formal confrontation.”
—Angela Carter (1940–1992)
“He that writes to himself writes to an eternal public. That statement only is fit to be made public, which you have come at in attempting to satisfy your own curiosity.”
—Ralph Waldo Emerson (1803–1882)