2.4 Non-computable functions, the Halting Problem 2.5 Deterministic time and the classP
See
Sanjeev Arora, Boaz Barak:
Computational Complexity — A Modern Approach,
p. 23–29, Cambridge University Press: Cambridge-New York-Melbourne, 2009
CT 2.5 Deterministic time and the classP 13/40
c
Ernst W. Mayr
Chapter II N P and N P -completeness
1. The class N P
See
Sanjeev Arora, Boaz Barak:
Computational Complexity — A Modern Approach,
p. 37–39, Cambridge University Press: Cambridge-New York-Melbourne, 2009
CT 1 The classN P 14/40
c
Ernst W. Mayr