Category:Theoretical computer science

A

• Algorithms (44 C, 132 P)

C

• Computational learning theory (21 P)

E

• Evolutionary computation (2 C, 26 P)

F

• Formal languages (7 C, 143 P)
• Formal methods (5 C, 77 P)

G

• Graph theory (20 C, 110 P)

I

• Information theory (14 C, 172 P)

L

• Logic in computer science (14 C, 76 P)

M

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

P

• Pseudorandomness (1 C, 9 P)

Q

• Quantum computing (3 C, 62 P)
• Quantum information science (7 C, 131 P)

T

• Theoretical computer scientists (1 C, 246 P)
• Theory of computation (7 C, 88 P)

• Theoretical computer science

A

• ACM Doctoral Dissertation Award
• ACM SIGACT
• Algorithm
• Algorithm engineering
• Algorithmic logic
• Algorithmic technique
• Algorithmic transparency
• Ambient calculus
• Analysis of Boolean functions
• Angelic non-determinism
• API-Calculus
• Automated reasoning

B

• Bigraph
• Bio-inspired computing
• Bird–Meertens formalism
• Bisimulation
• Bridging model
• British Colloquium for Theoretical Computer Science

C

• Physics:Calculating Space
• Categorical logic
• Chaos computing
• Circuit Value Problem
• Cobham's theorem
• Coinduction
• Combinatorial optimization
• Comp.theory
• Complexity class
• Complexity function
• Organization:Computability in Europe
• Computation
• Computational irreducibility
• Computational problem
• Concurrence (quantum computing)
• Configurable modularity
• Corecursion
• Correctness (computer science)

D

• Demonic non-determinism
• Description number
• Physics:Digital probabilistic physics
• Dis-unification (computer science)
• Dominance-based rough set approach
• Dynamic Data Driven Applications Systems

E

• Error tolerance (PAC learning)
• Exact cover
• Expander mixing lemma
• Extractor (mathematics)

F

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

G

• Grammar systems theory
• Granular computing

H

• Hidden subgroup problem
• Hindley–Milner type system
• Hub labels

I

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

J

• Journal of Automata, Languages and Combinatorics

K

• Knowledge Based Software Assistant
• Knuth's Simpath algorithm
• Krivine machine

L

• Lambda calculus
• Language Of Temporal Ordering Specification
• Learning augmented algorithm
• Least-squares spectral analysis
• Level ancestor problem
• LogP machine
• Lowest common ancestor
• Lulu smoothing

M

• Manifold hypothesis
• Monge array
• Motion planning

N

• Natural computing
• Neighbour-sensing model
• Nominal techniques
• Nominal terms (computer science)
• Notation for theoretic scheduling problems

O

• Occam learning

P

• Pattern language (formal languages)
• PEPA
• Postselection
• Probabilistic bisimulation
• Profinite word
• Promise theory
• Property testing
• Pseudorandomness

Q

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

R

• Ranked alphabet
• Regular numerical predicate

S

• Scientific community metaphor
• Transwiki:Scientific community metaphor
• Engineering:Silq
• Simulation (computer science)
• Summer School Marktoberdorf
• Sun–Ni law

T

• Biology:Transcriptor