Statements (70)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
branch of mathematical logic branch of theoretical computer science |
| gptkbp:alsoKnownAs |
recursion theory
|
| gptkbp:hasApplication |
gptkb:artificial_intelligence
gptkb:complexity_theory gptkb:logic cryptography formal languages automated theorem proving compiler design algorithm design model checking software verification program analysis |
| gptkbp:hasConcept |
gptkb:Gödel_numbering
gptkb:Rice's_theorem gptkb:lambda_calculus gptkb:Church-Turing_thesis gptkb:Post_correspondence_problem gptkb:register_machine gptkb:universal_Turing_machine gptkb:Markov_algorithm gptkb:arithmetical_hierarchy gptkb:hyperarithmetical_hierarchy gptkb:oracle_Turing_machine gptkb:recursion_theorem gptkb:Turing_reduction gptkb:many-one_reduction theoretical computer science diagonalization halting problem primitive recursive functions reduction partial recursive functions Turing degree mu-recursive functions oracle machines recursively enumerable set computational universality computable numbers computable set effective procedure enumeration theorem non-computable set recursive enumerable sets recursive set uncomputable functions |
| https://www.w3.org/2000/01/rdf-schema#label |
Computability Theory
|
| gptkbp:notablePerson |
gptkb:Alan_Turing
gptkb:Alonzo_Church gptkb:Emil_Post gptkb:Kurt_Gödel gptkb:Martin_Davis gptkb:Stephen_Kleene gptkb:Andrey_Kolmogorov gptkb:Yuri_Matiyasevich |
| gptkbp:relatedTo |
gptkb:complexity_theory
gptkb:logic automata theory theoretical computer science |
| gptkbp:studies |
Turing machines
computable functions computational complexity decidability recursive functions degrees of unsolvability algorithmic problems |
| gptkbp:bfsParent |
gptkb:S._Barry_Cooper
|
| gptkbp:bfsLayer |
8
|