Kleene's T predicate
id:
kleene-s-t-predicate-292-7583315
title:
Kleene's T predicate
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in computability theory
original url:
https://en.wikipedia.org/wiki/Kleene%27s_T_predicate
date created:
date modified:
2023-06-05T12:24:04Z
main entity:
{"identifier":"Q6420085","url":"https://www.wikidata.org/entity/Q6420085"}
image:
fields total:
13
integrity:
14