former devoted analyzing amount resources needed particular algorithm solve problem whereas latter asks general question possible algorithms could used solve problem precisely computational complexity theory tries classify problems cannot solved appropriately restricted resources turn imposing restrictions available resources distinguishes computational complexity computability theory latter theory asks kinds problems principle solved algorithmically computational problems traveling salesman tour german
Formal science Computer science Theory of computation Computational complexity theory