About: Theoretical computer science

Property	Value
dbo:wikiPageID	990361 (xsd:integer)
dbo:wikiPageRevisionID	969858770 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commonscat dbt:CatAutoTOC dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Theoretical computer science (en)
skos:broader	dbc:Subfields_of_computer_science dbc:Formal_sciences dbc:Applied_mathematics
skos:prefLabel	Theoretical computer science (en)
prov:wasDerivedFrom	wikipedia-en:Category:Theoretical_computer_science?oldid=969858770&ns=14
is dbo:wikiPageWikiLink of	dbr:Categorical_logic dbr:Promise_theory dbr:Quantum_complexity_theory dbr:Quasi-empiricism_in_mathematics dbr:Roger_Schank dbr:Scientific_community_metaphor dbr:Profinite_word dbr:Bigraph dbr:Bio-inspired_computing dbr:Algorithm dbr:Algorithm_engineering dbr:Algorithmic_logic dbr:Algorithmic_technique dbr:Algorithmic_transparency dbr:Description_number dbr:Dynamic_Data_Driven_Applications_Systems dbr:Indirect_self-reference dbr:Institution_(computer_science) dbr:Institutional_model_theory dbr:Interactive_computation dbr:Quantum_computing dbr:Semigroup_action dbr:Level_ancestor_problem dbr:Pseudorandomness dbr:Computability_in_Europe dbr:Computational_irreducibility dbr:Analysis_of_Boolean_functions dbr:Chemical_computer dbr:Error_tolerance_(PAC_learning) dbr:Nominal_techniques dbr:Nominal_terms_(computer_science) dbr:Small-bias_sample_space dbr:Quantum_algorithm dbr:Quantum_capacity dbr:Coinduction dbr:French_Institute_for_Research_in_Computer_Science_and_Automation dbr:Glossary_of_quantum_computing dbr:Concurrence_(quantum_computing) dbr:Configurable_modularity dbr:Corecursion dbr:Correctness_(computer_science) dbr:Representer_theorem dbr:Lowest_common_ancestor dbr:Calculating_Space dbr:Combinatorial_optimization dbr:Comp.theory dbr:Complexity_class dbr:Complexity_function dbr:Computation dbr:Computational_learning_theory dbr:Computational_problem dbr:Demonic_non-determinism dbr:Full-employment_theorem dbr:Fundamenta_Informaticae dbr:Journal_of_Automata,_Languages_and_Combinatorics dbr:Krivine_machine dbr:PEPA dbr:Pattern_language_(formal_languages) dbr:Machine_learning_in_physics dbr:Theoretical_computer_science dbr:Theory_of_Computing_Systems dbr:Occam_learning dbr:Transcriptor dbr:Tree_(automata_theory) dbr:Tree_automaton dbr:Tree_transducer dbr:Gödel_Prize dbr:Language_Of_Temporal_Ordering_Specification dbr:Learning_augmented_algorithm dbr:Least-squares_spectral_analysis dbr:LogP_machine dbr:Rough_set dbr:Ambient_calculus dbr:Exact_cover dbr:Formal_verification dbr:Angelic_non-determinism dbr:Bridging_model dbr:British_Colloquium_for_Theoretical_Computer_Science dbr:Dis-unification_(computer_science) dbr:Formal_language dbr:Formal_methods dbr:Grammar_systems_theory dbr:Granular_computing dbr:Knowledge_Based_Software_Assistant dbr:Knuth's_Simpath_algorithm dbr:Knuth_Prize dbr:Recursive_definition dbr:Quantum_digital_signature dbr:Quantum_machine_learning dbr:Hindley–Milner_type_system dbr:ACM_Doctoral_Dissertation_Award dbr:ACM_SIGACT dbr:API-Calculus dbr:Lambda_calculus dbr:Bird–Meertens_formalism dbr:Bisimulation dbr:Cobham's_theorem dbr:Regular_numerical_predicate dbr:Dominance-based_rough_set_approach dbr:Automated_reasoning dbr:Circuit_Value_Problem dbr:Hub_labels dbr:Idempotence dbr:Ranked_alphabet dbr:Recursion_(computer_science) dbr:Reed–Muller_code dbr:Chaos_computing dbr:Π-calculus dbr:Lulu_smoothing dbr:Turing_machine dbr:Weakest_precondition dbr:Neighbour-sensing_model dbr:Nerode_Prize dbr:Unrestricted_algorithm dbr:European_Association_for_Theoretical_Computer_Science dbr:Expander_mixing_lemma dbr:Extractor_(mathematics) dbr:Postselection dbr:Probabilistic_bisimulation dbr:Summer_School_Marktoberdorf dbr:Flajolet_Lecture_Prize dbr:Manifold_hypothesis dbr:Natural_computing dbr:Monge_array dbr:Motion_planning dbr:Simulation_(computer_science) dbr:Safety_and_liveness_properties dbr:Spintronics dbr:Property_testing dbr:Quantum_threshold_theorem dbr:Tardiness_(scheduling) dbr:Sun–Ni_law
is dcterms:subject of	dbr:Categorical_logic dbr:Promise_theory dbr:Quantum_complexity_theory dbr:Quasi-empiricism_in_mathematics dbr:Roger_Schank dbr:Scientific_community_metaphor dbr:Profinite_word dbr:Bigraph dbr:Bio-inspired_computing dbr:Algorithm dbr:Algorithm_engineering dbr:Algorithmic_logic dbr:Algorithmic_technique dbr:Algorithmic_transparency dbr:Description_number dbr:Dynamic_Data_Driven_Applications_Systems dbr:Indirect_self-reference dbr:Institution_(computer_science) dbr:Institutional_model_theory dbr:Interactive_computation dbr:Quantum_computing dbr:Semigroup_action dbr:Level_ancestor_problem dbr:Pseudorandomness dbr:Computability_in_Europe dbr:Computational_irreducibility dbr:Analysis_of_Boolean_functions dbr:Chemical_computer dbr:Error_tolerance_(PAC_learning) dbr:Nominal_techniques dbr:Nominal_terms_(computer_science) dbr:Small-bias_sample_space dbr:Quantum_algorithm dbr:Quantum_capacity dbr:Coinduction dbr:French_Institute_for_Research_in_Computer_Science_and_Automation dbr:Glossary_of_quantum_computing dbr:Concurrence_(quantum_computing) dbr:Configurable_modularity dbr:Corecursion dbr:Correctness_(computer_science) dbr:Representer_theorem dbr:Lowest_common_ancestor dbr:Calculating_Space dbr:Combinatorial_optimization dbr:Comp.theory dbr:Complexity_class dbr:Complexity_function dbr:Computation dbr:Computational_learning_theory dbr:Computational_problem dbr:Demonic_non-determinism dbr:Full-employment_theorem dbr:Fundamenta_Informaticae dbr:Journal_of_Automata,_Languages_and_Combinatorics dbr:Krivine_machine dbr:PEPA dbr:Pattern_language_(formal_languages) dbr:Machine_learning_in_physics dbr:Theoretical_computer_science dbr:Theory_of_Computing_Systems dbr:Occam_learning dbr:Transcriptor dbr:Tree_(automata_theory) dbr:Tree_automaton dbr:Tree_transducer dbr:Gödel_Prize dbr:Language_Of_Temporal_Ordering_Specification dbr:Learning_augmented_algorithm dbr:Least-squares_spectral_analysis dbr:LogP_machine dbr:Rough_set dbr:Ambient_calculus dbr:Exact_cover dbr:Formal_verification dbr:Angelic_non-determinism dbr:Bridging_model dbr:British_Colloquium_for_Theoretical_Computer_Science dbr:Dis-unification_(computer_science) dbr:Formal_language dbr:Formal_methods dbr:Grammar_systems_theory dbr:Granular_computing dbr:Knowledge_Based_Software_Assistant dbr:Knuth's_Simpath_algorithm dbr:Knuth_Prize dbr:Recursive_definition dbr:Quantum_digital_signature dbr:Quantum_machine_learning dbr:Hindley–Milner_type_system dbr:ACM_Doctoral_Dissertation_Award dbr:ACM_SIGACT dbr:API-Calculus dbr:Lambda_calculus dbr:Bird–Meertens_formalism dbr:Bisimulation dbr:Cobham's_theorem dbr:Regular_numerical_predicate dbr:Dominance-based_rough_set_approach dbr:Automated_reasoning dbr:Circuit_Value_Problem dbr:Hub_labels dbr:Idempotence dbr:Ranked_alphabet dbr:Recursion_(computer_science) dbr:Reed–Muller_code dbr:Chaos_computing dbr:Π-calculus dbr:Lulu_smoothing dbr:Turing_machine dbr:Weakest_precondition dbr:Neighbour-sensing_model dbr:Nerode_Prize dbr:Unrestricted_algorithm dbr:European_Association_for_Theoretical_Computer_Science dbr:Expander_mixing_lemma dbr:Extractor_(mathematics) dbr:Postselection dbr:Probabilistic_bisimulation dbr:Summer_School_Marktoberdorf dbr:Flajolet_Lecture_Prize dbr:Manifold_hypothesis dbr:Natural_computing dbr:Monge_array dbr:Motion_planning dbr:Simulation_(computer_science) dbr:Safety_and_liveness_properties dbr:Spintronics dbr:Property_testing dbr:Quantum_threshold_theorem dbr:Tardiness_(scheduling) dbr:Sun–Ni_law
is skos:broader of	dbc:Computational_learning_theory dbc:Quantum_computing dbc:Mathematical_theorems_in_theoretical_computer_science dbc:Evolutionary_computation dbc:Mathematics_of_computing dbc:Theoretical_computer_scientists dbc:Information_theory dbc:Pursuit–evasion dbc:Quantum_information_science dbc:Algorithms dbc:Formal_methods dbc:Logic_in_computer_science dbc:Problems_in_computer_science dbc:Theoretical_computer_science_conferences dbc:Graph_theory dbc:Formal_languages dbc:Rewriting_systems dbc:Theory_of_computation dbc:Natural_computation dbc:Pseudorandomness