In computability theory, the T predicate, due to American mathematician Stephen Cole Kleene, is a particular ternary relation on natural numbers that is used to obtain a normal form for computable functions and to represent computability 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.
| Property | Value |
|---|
| dbpprop:abstract
|
- In computability theory, the T predicate, due to American mathematician Stephen Cole Kleene, is a particular ternary relation on natural numbers that is used to obtain a normal form for computable functions and to represent computability 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.
|
| dbpprop:hasPhotoCollection
| |
| rdfs:comment
|
- In computability theory, the T predicate, due to American mathematician Stephen Cole Kleene, is a particular ternary relation on natural numbers that is used to obtain a normal form for computable functions and to represent computability 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.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
