The Pedia - Category:Theoretical computer science

Site Navigation

Categories:
Computer science
Subdivisions of mathematics

Summary Of: Category:Theoretical computer science

Encyclodia Page On: Category:Theoretical computer science

These Are Links To Other Documents

category | Theoretical computer science | learn more | Theoretical computer science | ACM SIGACT | Abstract family of acceptors | Algebraic semantics | Algorithm | Algorithm engineering | Algorithm characterizations | Algorithm examples | AlphaRenaming | Automated reasoning | Biologically inspired computing | Bisimulation | Bridging model | British Colloquium for Theoretical Computer Science | Categorical logic | Chemical computer | Closure (computer science) | Coinduction | Computability in Europe | Computation | Computational irreducibility | Computational overhead | Computational problem | Concurrence (quantum computing) | Conditional random field | Configurable modularity | Corecursion | Digital probabilistic physics | Discrete tomography | DNA computing | Dominance-based Rough Set Approach | Dynamic data driven application system | Epsilon-Biased Sample Spaces | European Association for Theoretical Computer Science | Exact cover | Expander mixing lemma | Extractor (mathematics) | Formal semantics of programming languages | Formal language | Formal verification | Fredkin finite nature hypothesis | Full employment theorem | Fundamenta Informaticae | Gödel Prize | Grammar systems theory | Granular computing | Gustafson's law | Hidden Markov random field | Idempotence | Indirect self-reference | Institut national de recherche en informatique et en automatique | Institution (computer science) | Institutional model theory | Interactive computation | Journal of Automata, Languages and Combinatorics | Knuth Prize | Krohn–Rhodes theory | Lambda calculus | LogP machine | Lowest common ancestor | Markov logic network | Markov random field | Monge array | Motion planning | Natural Computing | Neighbour-sensing model | Nominal techniques | Notation for theoretic scheduling problems | Peptide computing | Photonic computing | Pi calculus | Predicate transformer semantics | Probabilistic bisimulation | Program (mathematical object) | Programming language theory | Promise theory | Property testing | Pseudorandomness | Pursuit-evasion | Quantum computer | Quantum algorithm | Quantum digital signature | Quantum threshold theorem | Quasi-empiricism in mathematics | Recursion (computer science) | Recursive definition | Rough set | Roger Schank | Schwartz–Zippel lemma | Scientific community metaphor | Semigroup action | Sharp-SAT | Simulation preorder | Spintronics | Stuttering equivalence | Task-oriented Information Modelling | Turing machine | Weakest precondition | Categories | Computer science | Subdivisions of mathematics |

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Category:Theoretical computer science".