||Godelian arguments use Godel's incompleteness theorems to argue against the possibility of human-level computer intelligence. Godel proved that any number system strong enough to do arithmetic would contain true propositions that were impossible to prove within the system. Let G be such a proposition, and let the relevant system correspond to a computer. It seems to follow that no computer can prove G (and so know G is true), but humans can know that G is true (by, as it were, moving outside of the number system and seeing that G has to be true to preserve soundness). So, it appears that humans are more powerful than computers restricted to just implementations of number systems. This is the essence of Godelian arguments. Many replies to these arguments have been put forward. An obvious reply is that computers can be programmed to be more than mere number systems and so can step outside number systems just like humans can.