Category:en:Theory of computing

From Wiktionary, the free dictionary
Jump to navigation Jump to search
Newest and oldest pages 
Newest pages ordered by last category link update:
  1. mem
  2. Kleene's recursion theorem
  3. Kleene's theorem
  4. Tarski-Kuratowski algorithm
  5. cone
  6. Kleene plus
  7. AFL
  8. spaghetti sort
  9. R* tree
  10. R+ tree
Oldest pages ordered by last edit:
  1. state machine
  2. angelic non-determinism
  3. functionally complete
  4. universal Turing machine
  5. computability
  6. computable
  7. transducer
  8. buddy system
  9. collisionless
  10. busy beaver

Fundamental » All languages » English » All topics » Sciences » Computer science » Theory of computing

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). To generate this category using one of these labels, use {{lb|en|label}}.


This category has only the following subcategory.


Pages in category "en:Theory of computing"

The following 200 pages are in this category, out of 298 total.

(previous page) (next page)
(previous page) (next page)