Computer science

Theoretical Computer Science
  1. Computable functions I: mu-recursion
  2. Computable functions II: lambda-calculus
  3. Computable functions III: the Turing machine
  4. Fundamental Thesis of CS I: Church-Turing
  5. Fundamental Thesis of CS II: Universal Turing Machine
  6. Fundamental Thesis of CS III: examples in proving Turing completeness
  7. Extensions of CS: Real numbers [1]
  8. A crash course on mathematical logic (old version: Godel, Turing and time travel)
  9. Fixing the crash in mathematical logic


    No comments:

    Post a Comment