|Lucas can't know when his Gödelization procedure is applicable|
For the Lucas argument to work, Lucas must still be able to tell which machines are consistent. But this is mathematically impossible.
G. Lee Bowie (1982).
Note: For further explanation, see Church’s theorem as discussed in Hunter (1973) or Enderton (1972).
Click the button to enter task scheduling information