Turing’s approach to machine intelligence was as unencumbered as his approach to computable numbers ten years before. He continued, once again, from where Gödel had left off. Does the incompleteness of formal systems limit the abilities of computers to duplicate the intelligence and creativity of the human mind? Turing summarized the essence (and weakness) of this convoluted argument in 1947, saying that “in other words then, if a machine is expected to be infallible, it cannot also be intelligent.”47 Instead of trying to build infallible machines, we should be developing fallible machines
...more
hmm
