Are we paraconsistent? on the luca-penrose argument and the computational theory of mind

Abstract

I argue that if we are Turing machines, as the Computational Theory of Mind (CTM) holds, then we are paraconsistent, i.e. we do not implement classical logic as canonical versions of the CTM generally hold (or assume).