Category:fr:Theory of computing

From Wiktionary, the free dictionary
Jump to navigation Jump to search
Edit category data
Recent changes
Newest and oldest pages 
Newest pages ordered by last category link update:
  1. NP-complet
  2. NP-complétude
  3. NP-difficile
  4. machine de Turing
Oldest pages ordered by last edit:
  1. machine de Turing
  2. NP-difficile
  3. NP-complétude
  4. NP-complet

French 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|fr|label}}.


Pages in category "fr:Theory of computing"

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

M

N

Retrieved from "https://en.wiktionary.org/w/index.php?title=Category:fr:Theory_of_computing&oldid=67467036"