[2] Many of the central philosophical questions of computer science are centered on the logical, ethical, methodological, ontological and epistemological issues that concern it.
[3] Some of these questions may include: The Church–Turing thesis and its variations are central to the theory of computation.
It asks whether every problem whose solution can be verified in polynomial time (and so defined to belong to the class NP) can also be solved in polynomial time (and so defined to belong to the class P).
For instance, according to Scott Aaronson, the American computer scientist then at MIT: If P = NP, then the world would be a profoundly different place than we usually assume it to be.
There would be no special value in "creative leaps", no fundamental gap between solving a problem and recognizing the solution once it's found.