Philips, N.C.K.
(Computer Society of South Africa (on behalf of SAICSIT), 1979)
Despite intensive research the P = NP question is unresolved and the research suggests thatitis
hard to answer. The corresponding question for query machines with recursive oracles is undecidable
in set theory. Simply ...