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 predicate of truth-value of a proposition, therefore, is a mere fictive quality; its place is in an ideal world of science only, whereas actual science cannot make use of it. Actual science instead employs throughout the predicate of weight.”
—Hans Reichenbach (1891–1953)