What makes the problem more fundamental than another?

Question

Is there any formal definition of what makes a problem more fundamental than another? Otherwise, what would be an acceptable informal definition?

An example of a problem that is more fundamental than another will sort against font rendering.

Answer 1

The original question is valid and should not suggest / consider complexity and reducibility, as @slebetman suggested. (Thus, the question becomes more fundamental :)

, : P1 , P2, P1 . , , P1 - , , .

@slebetman. " - , , ", , ", , , " . , ; , .

Answer 2

, , . . , , ? , . . http://en.wikipedia.org/wiki/Reduction_(complexity)

Answer 3

.

, , , , , . , , , .

Answer 4

, , .

( , P!= NP ( ), rendeering .)

Answer 5

Inf , , , / . , .

, . , , . , : , - , , .

: . , , , , , . , . , NP. NP ? , P!= NP, , . , P!= NP , .

P!= NP . , NP , . , NP . , ? - , , : while (1) {print "still running!"}. , ? , . , , P!= NP.

. , . ? , ? , , Turing , , Turing. , , .

We can go on and discuss our assumptions like: Are all signals equivalent? Is it possible that a liquid or mechanical computer is fundamentally different from an electronic computer? And this will lead us to such things as Shannon’s information theory and Boolean algebra, etc., And each assumption that we reveal is more fundamental than what is above it.