Alan Turing

In any sufficiently powerful logical system statements can be formulated which can neither be proved nor disproved within the system, unless possibly the system itself is inconsistent. Turing’s restatement of Godel’s Incompleteness Theorem.

In any sufficiently powerful logical system statements can be formulated which can neither be proved nor disproved within the system, unless possibly the system itself is inconsistent.

Turing’s restatement of Godel’s Incompleteness Theorem.

Leave a Reply

Your email address will not be published. Required fields are marked *