|
gptkbp:instanceOf
|
gptkb:academic
gptkb:branch_of_mathematical_logic
gptkb: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:theoretical_computer_science
gptkb:Gödel_numbering
gptkb:Rice's_theorem
gptkb:lambda_calculus
gptkb:Turing_degree
gptkb:reduction
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
diagonalization
halting problem
primitive recursive functions
partial recursive functions
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
|
|
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:theoretical_computer_science
gptkb:complexity_theory
gptkb:logic
automata theory
|
|
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
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Computability Theory
|