•  7
    Benacerraf's opacity objection to the Lucas-Penrose argument holds that even if a Turing machine governs mathematical judgment, we could never identify which one, and so could never construct its Gödel sentence. This paper grants the objection and argues without what it denies. Every $\Pi^1_1$-sound recursively enumerable theory has a proof-theoretic ordinal strictly below the Church-Kleene ordinal $\omega_1^{\mathrm{CK}}$, and this bound follows from the computational hypothesis and a soundness…Read more
  •  11
    There are two approaches for simulating memory as well as learning in artificial intelligence; the functionalistic approach and the cognitive approach. The necessary condition to put the second approach into account is to provide a model of brain activity that contains a quite good congruence with observational facts such as mistakes and forgotten experiences. Given that human memory has a solid core that includes the components of our identity, our family and our hometown, the major and determi…Read more