Category:Theoretical computer science

C

• ► Computational complexity theory‎ (14 C, 92 P)
• ► Computational learning theory‎ (15 P)

E

• ► Evolutionary computation‎ (3 C, 23 P)

F

• ► Formal languages‎ (9 C, 194 P)
• ► Formal methods‎ (18 C, 87 P)

G

• ► Graph theory‎ (25 C, 92 P)

I

• ► Information theory‎ (13 C, 174 P)

L

• ► Logic in computer science‎ (18 C, 93 P)

M

• ► Mathematical theorems in theoretical computer science‎ (6 P)
• ► Mathematics of computing‎ (6 C, 5 P)

N

• ► Natural computation‎ (3 P)

P

• ► Pseudorandomness‎ (1 C, 15 P)

Q

• ► Quantum information science‎ (6 C, 126 P)

R

• ► Rewriting systems‎ (6 C, 26 P)

T

• ► Theoretical computer science conferences‎ (30 P)
• ► Theoretical computer scientists‎ (2 C, 165 P)
• ► Theory of computation‎ (8 C, 96 P)

U

• ► Unsolved problems in computer science‎ (19 P)

Σ

• ► Theoretical computer science stubs‎ (100 P)

*

• Theoretical computer science

A

• ACM SIGACT
• AI box
• Algorithm
• Algorithm engineering
• Automated reasoning

B

• Bigraph
• Bio-inspired computing
• Bisimulation
• Bridging model
• British Colloquium for Theoretical Computer Science

C

• Categorical logic
• Chemical computer
• Coinduction
• Complexity function
• Computability in Europe
• Computation
• Computational irreducibility
• Computational learning theory
• Computational problem
• Concurrence (quantum computing)
• Configurable modularity
• Corecursion
• Correctness (computer science)

D

• Digital probabilistic physics
• DNA computing
• Dominance-based rough set approach
• Dynamic data-driven application system

E

• European Association for Theoretical Computer Science
• Exact cover
• Expander mixing lemma
• Extractor (mathematics)

F

• Formal language
• Formal methods
• Formal verification
• Fredkin finite nature hypothesis
• Full employment theorem
• Fundamenta Informaticae

G

• Gödel Prize
• Grammar systems theory
• Granular computing
• Gustafson's law

H

• Hidden Markov random field

I

• Idempotence
• Indirect self-reference
• Institution (computer science)
• Institutional model theory
• Interactive computation

J

• Journal of Automata, Languages and Combinatorics

K

• Knuth Prize
• Krohn–Rhodes theory

L

• Lambda calculus
• Level ancestor problem
• LogP machine
• Lowest common ancestor
• Lulu smoothing

M

• Markov logic network
• Monge array
• Motion planning

N

• National Institute for Research in Computer Science and Control
• Natural computing
• Neighbour-sensing model
• Nerode Prize
• Nominal techniques

N cont.

• Nominal terms (computer science)
• Notation for theoretic scheduling problems

P

• Peptide computing
• Π-calculus
• Postselection
• Probabilistic bisimulation
• Promise theory
• Property testing
• Pseudorandomness
• Pursuit-evasion

Q

• Quantum algorithm
• Quantum capacity
• Quantum computer
• Quantum digital signature
• Quantum threshold theorem
• Quasi-empiricism in mathematics

R

• Recursion (computer science)
• Recursive definition
• Representer theorem
• Rough set

S

• Roger Schank
• Scientific community metaphor
• Semigroup action
• Simulation preorder
• Small-bias sample space
• Spintronics
• Sun-Ni law

T

• Task-oriented information modelling
• Transcriptor
• Turing machine
• Hindley–Milner

W

• Weakest precondition