About: Theory of computation

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

Property	Value
dbo:wikiPageID	3233312 (xsd:integer)
dbo:wikiPageRevisionID	938046887 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commons_category dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Theory of computation (en)
skos:broader	dbc:Subfields_of_computer_science dbc:Theoretical_computer_science
skos:prefLabel	Theory of computation (en)
prov:wasDerivedFrom	wikipedia-en:Category:Theory_of_computation?oldid=938046887&ns=14
is dbo:wikiPageWikiLink of	dbr:Primitive_recursive_function dbr:Rounding dbr:Entscheidungsproblem dbr:Enumerator_(computer_science) dbr:List_of_computability_and_complexity_topics dbr:Mortality_(computability_theory) dbr:Typed_lambda_calculus dbr:Algorithmic_game_theory dbr:Cylindric_numbering dbr:Cylindrification dbr:Undefined_value dbr:Universality_probability dbr:Description_number dbr:Interactive_computation dbr:International_Conference_on_Reachability_Problems dbr:Intersection_type_discipline dbr:Introduction_to_the_Theory_of_Computation dbr:Limits_of_computation dbr:Numbering_(computability_theory) dbr:Primitive_recursive_set_function dbr:Computability dbr:Computable_function dbr:Omega_language dbr:Reachability_problem dbr:Turing_machine_equivalents dbr:Quantum_Byzantine_agreement dbr:Church–Turing_thesis dbr:General_recursive_function dbr:Andreas_Brandstädt dbr:Simply_typed_lambda_calculus dbr:Communicating_X-Machine dbr:Computable_number dbr:Computable_set dbr:Computably_enumerable_set dbr:Computation_history dbr:Computation_in_the_limit dbr:Computational_semiotics dbr:Post_correspondence_problem dbr:Sudan_function dbr:Theory_of_computation dbr:Markov_algorithm dbr:Mutual_recursion dbr:Busy_beaver dbr:Admissible_numbering dbr:Turing's_proof dbr:Gödel_numbering dbr:Recursively_enumerable_language dbr:Extended_finite-state_machine dbr:Bremermann's_limit dbr:Brooks–Iyengar_algorithm dbr:Church–Turing–Deutsch_principle dbr:Digital_physics dbr:History_of_the_Church–Turing_thesis dbr:Ludwig_Staiger dbr:Recursion dbr:Halting_problem dbr:Hypercomputation dbr:Yao's_test dbr:Ackermann_function dbr:Blockhead_(thought_experiment) dbr:Tail_recursion dbr:Effective_method dbr:Reachability_analysis dbr:Recursive_language dbr:Byzantine_fault dbr:Circuit_(computer_science) dbr:Chain_rule_for_Kolmogorov_complexity dbr:Chaitin's_constant dbr:Self-reference dbr:X-Machine_Testing dbr:SXM_(computational_model) dbr:Wang_tile dbr:Scale_factor_(computer_science) dbr:Semi-Thue_system dbr:List_of_undecidable_problems dbr:Ten15 dbr:Real_computation dbr:First_Draft_of_a_Report_on_the_EDVAC dbr:Tarski–Kuratowski_algorithm dbr:Semiotic_engineering dbr:Super-recursive_algorithm dbr:Transcomputational_problem dbr:Nomogram dbr:Nondeterministic_algorithm dbr:Two_Generals'_Problem dbr:Shadow_square dbr:X-machine dbr:Parallel_computation_thesis dbr:Parallel_terraced_scan dbr:Turing_tarpit dbr:Size-change_termination_principle dbr:Stream_X-Machine dbr:Turing_degree dbr:Turing_completeness
is dcterms:subject of	dbr:Primitive_recursive_function dbr:Rounding dbr:Entscheidungsproblem dbr:Enumerator_(computer_science) dbr:List_of_computability_and_complexity_topics dbr:Mortality_(computability_theory) dbr:Typed_lambda_calculus dbr:Algorithmic_game_theory dbr:Cylindric_numbering dbr:Cylindrification dbr:Undefined_value dbr:Universality_probability dbr:Description_number dbr:Interactive_computation dbr:International_Conference_on_Reachability_Problems dbr:Intersection_type_discipline dbr:Introduction_to_the_Theory_of_Computation dbr:Limits_of_computation dbr:Numbering_(computability_theory) dbr:Primitive_recursive_set_function dbr:Computability dbr:Computable_function dbr:Omega_language dbr:Reachability_problem dbr:Turing_machine_equivalents dbr:Quantum_Byzantine_agreement dbr:Church–Turing_thesis dbr:General_recursive_function dbr:Andreas_Brandstädt dbr:Simply_typed_lambda_calculus dbr:Communicating_X-Machine dbr:Computable_number dbr:Computable_set dbr:Computably_enumerable_set dbr:Computation_history dbr:Computation_in_the_limit dbr:Computational_semiotics dbr:Post_correspondence_problem dbr:Sudan_function dbr:Theory_of_computation dbr:Markov_algorithm dbr:Mutual_recursion dbr:Busy_beaver dbr:Admissible_numbering dbr:Turing's_proof dbr:Gödel_numbering dbr:Recursively_enumerable_language dbr:Extended_finite-state_machine dbr:Bremermann's_limit dbr:Brooks–Iyengar_algorithm dbr:Church–Turing–Deutsch_principle dbr:Digital_physics dbr:History_of_the_Church–Turing_thesis dbr:Ludwig_Staiger dbr:Recursion dbr:Halting_problem dbr:Hypercomputation dbr:Yao's_test dbr:Ackermann_function dbr:Blockhead_(thought_experiment) dbr:Tail_recursion dbr:Effective_method dbr:Reachability_analysis dbr:Recursive_language dbr:Byzantine_fault dbr:Circuit_(computer_science) dbr:Chain_rule_for_Kolmogorov_complexity dbr:Chaitin's_constant dbr:Self-reference dbr:X-Machine_Testing dbr:SXM_(computational_model) dbr:Wang_tile dbr:Scale_factor_(computer_science) dbr:Semi-Thue_system dbr:List_of_undecidable_problems dbr:Ten15 dbr:Real_computation dbr:First_Draft_of_a_Report_on_the_EDVAC dbr:Tarski–Kuratowski_algorithm dbr:Semiotic_engineering dbr:Super-recursive_algorithm dbr:Transcomputational_problem dbr:Nomogram dbr:Nondeterministic_algorithm dbr:Two_Generals'_Problem dbr:Shadow_square dbr:X-machine dbr:Parallel_computation_thesis dbr:Parallel_terraced_scan dbr:Turing_tarpit dbr:Size-change_termination_principle dbr:Stream_X-Machine dbr:Turing_degree dbr:Turing_completeness
is skos:broader of	dbc:Limits_of_computation dbc:Algorithmic_information_theory dbc:Theorems_in_theory_of_computation dbc:Computer_arithmetic dbc:Computational_complexity_theory dbc:Computability_theory dbc:Models_of_computation dbc:Hypercomputation
is skos:related of	dbc:Computability_theory