Computability Theory
E173643
UNEXPLORED
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Introduction to the Theory of Computation
→
|
hasSection |