Kleene's T Predicate
In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic. Informally, the T predicate tells whether a particular computer program will halt when run with a particular input, and the corresponding U function is used to obtain the results of the computation if the program does halt. As with the smn theorem, the original notation used by Kleene has become standard terminology for the concept.
Read more about Kleene's T Predicate: Definition, Normal Form Theorem, Formalization, Arithmetical Hierarchy
Famous quotes containing the word predicate:
“The only thing that one really knows about human nature is that it changes. Change is the one quality we can predicate of it. The systems that fail are those that rely on the permanency of human nature, and not on its growth and development. The error of Louis XIV was that he thought human nature would always be the same. The result of his error was the French Revolution. It was an admirable result.”
—Oscar Wilde (1854–1900)