, , ,
:
P (x), x - . P (x) x, ..
P (0) = P (1) = P (2) =...?
: M(),
?
, (Turing-complete) , " ":
M(), :
P(x):
if x == 0:
return 0
Run M() for x steps
if M() has terminated then:
return 1
else:
return 0
:
P(0) = P(1) = P(2) = ...
=>
M() does not terminate.
M() does terminate
=> P(x) = 1 for a sufficiently large x
=> P(x) != P(0) = 0
, ; " " ( , ;-)
, . , , , . (, , ), .