Category:en:Theory of computing
| Newest and oldest pages |
|---|
| Newest pages ordered by last category link update: |
| Oldest pages ordered by last edit: |
English terms used in theoretical discussion of computer science or computing.
NOTE: This is a "related-to" category. It should contain terms directly related to theory of computing. Please do not include terms that merely have a tangential connection to theory of computing. Be aware that terms for types or instances of this topic often go in a separate category.
The following label generates this category: computing theory (alias comptheory)edit. To generate this category using one of these labels, use {{lb|en|label}}.
| Top – A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
Pages in category "en:Theory of computing"
The following 200 pages are in this category, out of 309 total.
(previous page) (next page)A
B
- B+ tree
- backjump
- backjumping
- backpatch
- Baeza-Yates-Gonnet algorithm
- bandelet
- BDD
- beta reduction
- big O notation
- binary search
- Bitap algorithm
- bitonic
- Bloom filter
- Blum's speedup theorem
- bogosort
- Boyer-Moore-Horspool algorithm
- Brewer's theorem
- Brzozowski derivative
- Buchberger's algorithm
- Büchi automaton
- bucket sort
- buddy block
- buddy memory allocation
- buddy system
- bundle adjustment
- Burrows-Wheeler transform
- busy beaver
- busy beaver function
C
- Canadian traveller problem
- CAP
- cellular automaton
- certificate
- CFG
- Chaitin's constant
- Chomsky Normal Form
- Church-Rosser theorem
- Church-Turing thesis
- collisionless
- Comba multiplication
- complete
- complexity function
- complexity theory
- computability
- computable
- computable analysis
- cone
- context-free
- context-free grammar
- coobservability
- coobservable
- Cook reduction
- co-recursively enumerable
- crisp
- critical exponent
- cubesort
- cycle sort