About: Kleene's T predicate

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Kleene's T predicate Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FKleene%27s_T_predicate&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdfs:label	Kleene's T predicate (en) Predicado T de Kleene (pt)
rdfs:comment	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. (en) Na Teoria da Computabilidade, o Predicado T, que foi primeiramente estudado pelo matemático Stephen Kleene, é uma conjunto de triplas particular de números naturais que é usado para representar Funções computaveis dentro das teorias formais da Aritmética. Informalmente, o predicado T diz se um Programa de computador em particular vai parar quando rodado com uma entrada em particular, e a função U é usada para obter os resultados da computação se o programa para. E com o Teorema smn, a notação original usada por Kleene se tornou padrão na terminologia do conceito. (pt)
foaf:depiction
dcterms:subject	Computability theory
Wikipage page ID	14103273 (xsd:integer)
Wikipage revision ID	1061854933 (xsd:integer)
Link from a Wikipage to another Wikipage	Primitive recursive function Peano arithmetic Computability theory Computable function General recursive function Mu operator Arithmetical hierarchy Stephen Cole Kleene Computer program Gödel numbering Gödel numbering for sequences Robinson arithmetic Ternary relation Halting problem Smn theorem Arithmetic Computability theory Theory (mathematical logic) Natural number Turing machine Robert I. Soare Post's theorem Turing degree Primitive recursive Turing complete set
Link from a Wikipage to an external page	https://www.ams.org/journals/tran/1943-053-01/S0002-9947-1943-0007371-8/S0002-9947-1943-0007371-8.pdf
sameAs	Kleene's T predicate Kleene's T predicate Kleene's T predicate Kleene's T predicate
dbp:wikiPageUsesTemplate	dbt:Background_color dbt:Cite_journal dbt:Isbn
thumbnail	wiki-commons:Special:FilePath/KleeneT_collatz5.gif?width=300
has abstract	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. (en) Na Teoria da Computabilidade, o Predicado T, que foi primeiramente estudado pelo matemático Stephen Kleene, é uma conjunto de triplas particular de números naturais que é usado para representar Funções computaveis dentro das teorias formais da Aritmética. Informalmente, o predicado T diz se um Programa de computador em particular vai parar quando rodado com uma entrada em particular, e a função U é usada para obter os resultados da computação se o programa para. E com o Teorema smn, a notação original usada por Kleene se tornou padrão na terminologia do conceito. (pt)
prov:wasDerivedFrom	wikipedia-en:Kleene's_T_predicate?oldid=1061854933&ns=0
page length (characters) of wiki page	8058 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Kleene's_T_predicate
is Link from a Wikipage to another Wikipage of	Normal form theorem General recursive function Constructive set theory Stephen Cole Kleene Admissible numbering Church's thesis (constructive mathematics) Craig's theorem Heyting arithmetic Universal Turing machine Structured program theorem Kleene's normal form theorem Kleene normal form theorem
is Wikipage redirect of	Normal form theorem Kleene's normal form theorem Kleene normal form theorem
is foaf:primaryTopic of	wikipedia-en:Kleene's_T_predicate

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software