About: Computability theory

An Entity of Type: Concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Property	Value
dbo:wikiPageID	30870610 (xsd:integer)
dbo:wikiPageRevisionID	1021336967 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commonscat dbt:Portal dbt:CatAutoTOC dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Computability theory (en)
skos:broader	dbc:Mathematical_logic dbc:Theory_of_computation
skos:prefLabel	Computability theory (en)
skos:related	dbc:Theory_of_computation
prov:wasDerivedFrom	wikipedia-en:Category:Computability_theory?oldid=1021336967&ns=14
is dbo:wikiPageWikiLink of	dbr:Primitive_recursive_function dbr:Entscheidungsproblem dbr:Enumeration_reducibility dbr:Enumerator_(computer_science) dbr:Myhill_isomorphism_theorem dbr:Reverse_mathematics dbr:Decision_problem dbr:Description_number dbr:Double_recursion dbr:Incompressibility_method dbr:Index_set_(computability) dbr:Kőnig's_lemma dbr:Numbering_(computability_theory) dbr:Primitive_recursive_set_function dbr:Computability dbr:Computability_theory dbr:Computable_function dbr:Computably_inseparable dbr:Course-of-values_recursion dbr:Analytical_hierarchy dbr:Normal_form_(abstract_rewriting) dbr:Oracle_machine dbr:Μ_operator dbr:Trakhtenbrot's_theorem dbr:Church–Turing_thesis dbr:General_recursive_function dbr:Bounded_quantifier dbr:Creative_and_productive_sets dbr:Martin_measure dbr:Arithmetical_hierarchy dbr:Arithmetical_set dbr:Basis_theorem_(computability) dbr:Complete_numbering dbr:Computability_logic dbr:Computable_analysis dbr:Computable_number dbr:Computable_ordinal dbr:Computable_set dbr:Computably_enumerable_set dbr:Computation dbr:Computation_in_the_limit dbr:Friedberg_numbering dbr:Hardy_hierarchy dbr:Krivine_machine dbr:Low_basis_theorem dbr:Post_correspondence_problem dbr:McCarthy_Formalism dbr:Busy_beaver dbr:Admissible_numbering dbr:Turing_computability dbr:Gödel_numbering_for_sequences dbr:K-trivial_set dbr:Primitive_recursive_functional dbr:Algorithm_characterizations dbr:ELEMENTARY dbr:Alpha_recursion_theory dbr:Church–Turing–Deutsch_principle dbr:Fast-growing_hierarchy dbr:Forcing_(computability) dbr:History_of_the_Church–Turing_thesis dbr:Kolmogorov_complexity dbr:Lempel–Ziv_complexity dbr:Halting_problem dbr:High_(computability) dbr:Craig's_theorem dbr:Hyperarithmetical_theory dbr:Smn_theorem dbr:Ackermann_function dbr:LOOP_(programming_language) dbr:Lambda_calculus dbr:Effective_Polish_space dbr:Effective_method dbr:Recursive_language dbr:Automatic_group dbr:Automatic_semigroup dbr:Circuit_satisfiability_problem dbr:Grzegorczyk_hierarchy dbr:Recursion_(computer_science) dbr:Chain_rule_for_Kolmogorov_complexity dbr:Kleene's_T_predicate dbr:Kleene's_recursion_theorem dbr:Maximal_set dbr:Model_of_computation dbr:Turing_machine dbr:Undecidable_problem dbr:List_of_undecidable_problems dbr:Turing_jump dbr:Low_(computability) dbr:Post's_theorem dbr:Richardson's_theorem dbr:Tarski–Kuratowski_algorithm dbr:UTM_theorem dbr:Reverse_Mathematics:_Proofs_from_the_Inside_Out dbr:Simple_set dbr:PA_degree dbr:Slicing_the_Truth dbr:Slow-growing_hierarchy dbr:Turing_degree dbr:S2S_(mathematics) dbr:Π01_class
is dcterms:subject of	dbr:Primitive_recursive_function dbr:Entscheidungsproblem dbr:Enumeration_reducibility dbr:Enumerator_(computer_science) dbr:Myhill_isomorphism_theorem dbr:Reverse_mathematics dbr:Decision_problem dbr:Description_number dbr:Double_recursion dbr:Incompressibility_method dbr:Index_set_(computability) dbr:Kőnig's_lemma dbr:Numbering_(computability_theory) dbr:Primitive_recursive_set_function dbr:Computability dbr:Computability_theory dbr:Computable_function dbr:Computably_inseparable dbr:Course-of-values_recursion dbr:Analytical_hierarchy dbr:Normal_form_(abstract_rewriting) dbr:Oracle_machine dbr:Μ_operator dbr:Trakhtenbrot's_theorem dbr:Church–Turing_thesis dbr:General_recursive_function dbr:Bounded_quantifier dbr:Creative_and_productive_sets dbr:Martin_measure dbr:Arithmetical_hierarchy dbr:Arithmetical_set dbr:Basis_theorem_(computability) dbr:Complete_numbering dbr:Computability_logic dbr:Computable_analysis dbr:Computable_number dbr:Computable_ordinal dbr:Computable_set dbr:Computably_enumerable_set dbr:Computation dbr:Computation_in_the_limit dbr:Friedberg_numbering dbr:Hardy_hierarchy dbr:Krivine_machine dbr:Low_basis_theorem dbr:Post_correspondence_problem dbr:McCarthy_Formalism dbr:Busy_beaver dbr:Admissible_numbering dbr:Turing_computability dbr:Gödel_numbering_for_sequences dbr:K-trivial_set dbr:Primitive_recursive_functional dbr:Algorithm_characterizations dbr:ELEMENTARY dbr:Alpha_recursion_theory dbr:Church–Turing–Deutsch_principle dbr:Fast-growing_hierarchy dbr:Forcing_(computability) dbr:History_of_the_Church–Turing_thesis dbr:Kolmogorov_complexity dbr:Lempel–Ziv_complexity dbr:Halting_problem dbr:High_(computability) dbr:Craig's_theorem dbr:Hyperarithmetical_theory dbr:Smn_theorem dbr:Ackermann_function dbr:LOOP_(programming_language) dbr:Lambda_calculus dbr:Effective_Polish_space dbr:Effective_method dbr:Recursive_language dbr:Automatic_group dbr:Automatic_semigroup dbr:Circuit_satisfiability_problem dbr:Grzegorczyk_hierarchy dbr:Recursion_(computer_science) dbr:Chain_rule_for_Kolmogorov_complexity dbr:Kleene's_T_predicate dbr:Kleene's_recursion_theorem dbr:Maximal_set dbr:Model_of_computation dbr:Turing_machine dbr:Undecidable_problem dbr:List_of_undecidable_problems dbr:Turing_jump dbr:Low_(computability) dbr:Post's_theorem dbr:Richardson's_theorem dbr:Tarski–Kuratowski_algorithm dbr:UTM_theorem dbr:Reverse_Mathematics:_Proofs_from_the_Inside_Out dbr:Simple_set dbr:PA_degree dbr:Slicing_the_Truth dbr:Slow-growing_hierarchy dbr:Turing_degree dbr:S2S_(mathematics) dbr:Π01_class
is skos:broader of	dbc:Lambda_calculus dbc:Recursion dbc:Combinatory_logic dbc:Reduction_(complexity) dbc:Effective_descriptive_set_theory dbc:Turing_machine dbc:Computable_analysis dbc:Undecidable_problems dbc:Computability_theorists dbc:Hypercomputation

This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License