Normal Form Theorem
The T predicate can be used to obtain Kleene's normal form theorem for computable functions (Soare 1987, p. 15). This states there exists a primitive recursive function U such that a function f of one integer argument is computable if and only if there is a number e such that for all n one has
- ,
where μ is the μ operator and holds if both sides are undefined or if both are defined and they are equal. Here U is a universal operation (it is independent of the computable function f) whose purpose is to extract, from the number x (encoding a complete computation history) returned by the operator μ, just the value f(n) that was found at the end of the computation.
Read more about this topic: Kleene's T Predicate
Famous quotes containing the words normal, form and/or theorem:
“Freedom is poetry, taking liberties with words, breaking the rules of normal speech, violating common sense. Freedom is violence.”
—Norman O. Brown (b. 1913)
“I doubt that I would have taken so many leaps in my own writing or been as clear about my feminist and political commitments if I had not been anointed as early as I was. Some major form of recognition seems to have to mark a woman’s career for her to be able to go out on a limb without having her credentials questioned.”
—Ruth Behar (b. 1956)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)