# One generalization of the P NP hypothesis

Consider the informal statement "There if functions $f$ with the range of values $= \{0,1\}$, that can't be quickly calculate but if $f(x) = 0$ than we can quickly verify that it is true (by using some oracle)".

If "quickly" mean $\in P$ than it is statement $\iff P \not=NP$.

If "quickly" mean only computability (in world with infinitely quickly computers) than it is right statement ($f$ is for example function that solve Halting problem).

How else we can define "quicly" that it is statement became right?

-