Tag: formal systems

• A (partial) answer to my Goedelian conundrum?

  Last week I puzzled over what seemed to me to be the hand waiving dismissal, by both Alan Turing and Douglas Hofstadter of what I saw as the problem of humans being able to write true statements that the formal systems employed by computers could not determine – the problem thrown up by Goedel’s Incompleteness…

  Adrian McMenamin

  June 5, 2013

  Uncategorized

  Alan Turing, Church-Turing thesis, Computability, Douglas Hofstadter, Epimenides Paradox, formal systems, Gödel Escher Bach, Gödel numbering, Gödel’s incompleteness theorems, Goedel, machine intelligence, Number Theory, Tarski’s Theorem