• Physicalism and Non-Computability
• Some Definitions
  • Algorithm (or computation)
  • Turing Machines
  • Universal Turing Machine (UTM)
• Example of a Turing machine that adds 1 to an Unary number (UN+1)
• Example of a Computation that halts
• Examples of Computations that do not halt
• Deciding how computations stop - The Halting Problem
• Penrose's argument for computational irreducibility of cognition
  • Gödel's Theorem in a nutshell: Introduction
  • Gödel's Theorem in a nutshell: Argument
  • Gödels's Theorem in a nutshell: Conclusion
• References
• About this document ...