Category:Theoretical computer science

C

• [+] Compiler theory (1)
• [+] Computational complexity theory (8)

D

• [+] Database theory (0)

E

• [+] Evolutionary computation (3)

F

• [+] Formal languages (5)
• [+] Formal methods (18)

H

• [+] Human-based computation (1)

I

• [+] Information theory (9)

L

• [+] Logic in computer science (14)

M

• [+] Mathematics of computing (8)

N

• [+] Natural computation (0)

P

• [+] Pseudorandomness (1)

S

• [+] Semantics (14)

T

• [+] Theoretical computer science conferences (0)
• [+] Theoretical computer scientists (1)
• [+] Theory of computation (7)
• [+] Theory of cryptography (1)

U

• [+] Unsolved problems in computer science (0)

*

• Theoretical computer science

A

• ACM SIGACT
• Abstract family of acceptors
• Abstract family of languages
• Algebraic semantics
• Algorithm
• Algorithm characterizations
• Algorithm engineering
• Algorithm examples
• Algorithmica
• Algorithmically random sequence
• Automated reasoning
• Axiomatic semantics

B

• Biologically inspired computing
• Bisimulation
• Bridging model
• British Colloquium for Theoretical Computer Science

C

• Categorical logic
• Cheeger constant (graph theory)
• Chemical computer
• Closure (computer science)
• Coinduction
• Computability in Europe
• Computation
• Computational irreducibility
• Computational overhead
• Concurrence (quantum computing)
• Conditional random field
• Conductance (probability)
• Configurable modularity
• Corecursion
• Covering problem

D

• DNA computing
• Digital physics
• Digital probabilistic physics
• Discrete tomography
• Dominance-based Rough Set Approach
• User:Dratman
• Dynamic data driven application system

E

• Epsilon-Biased Sample Spaces
• European Association for Theoretical Computer Science

E cont.

• Exact cover
• Expander mixing lemma
• Extractor

F

• Formal language
• Formal semantics of programming languages
• Formal verification
• 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
• Institut national de recherche en informatique et en automatique
• Institution (computer science)
• Institutional model theory
• Interactive computation
• International Journal of Foundations of Computer Science
• Introduction to the Theory of Computation

J

• Josephus problem
• Journal of Automata, Languages and Combinatorics

K

• Kernelization
• Kineo CAM
• Knuth Prize
• Kripke structure
• Krohn–Rhodes theory

L

• Lambda calculus
• LogP machine
• Lowest common ancestor

M

• Markov logic network
• Markov random field
• Monge array
• Moore's law
• Morphological computation (robotics)
• Motion planning

N

• Near set
• Neighbour-sensing model
• Notation for theoretic scheduling problems

O

• Object-based

P

• P system

P cont.

• Page's law
• Pancomputationalism
• Peptide computing
• Photonic computing
• Pi-calculus
• Predicate transformer semantics
• Probabilistic bisimulation
• Program (mathematical object)
• Programming language theory
• Promise theory
• Pseudorandom generators for polynomials
• Pseudorandomness
• Pursuit-evasion

Q

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

R

• Recursion (computer science)
• Recursive definition
• Referential transparency (computer science)
• Rent's rule
• Rough set
• Runtime verification

S

• Scientific community metaphor
• Semigroup action
• Simulation preorder
• Spintronics
• Stuttering equivalence
• Supnick matrix
• Symmetric Turing machine

T

• Theoretical Computer Science (journal)
• Turing machine
• Turing machine examples
• Turing machine gallery
• Turing switch

U

• Universal Turing machine

W

• Wang B-machine
• Weakest liberal precondition
• Weakest precondition
• Wolfram's 2-state 3-symbol Turing machine
• Word problem (mathematics)