Article Index
Programmer’s Guide To Theory – Turing Thinking Turing Machines and Finite State Machines Finite State Turing

Page 1 of 3

Turing machines are the basis of computer science, but perhaps not in the way that you might think. There is a way of thinking about Turing machines that is special.



A Programmers Guide To Theory
Now available as a paperback and ebook from Amazon.

cover600


Contents

    1. What Is Computer Science?
      Part I What Is Computable?

    2. What Is Computation?

    3. The Halting Problem

    4. Finite State Machines
      Extract 1: Finite State Machines
      Extract 2: Turing Thinking ***NEW!

    5. Practical Grammar

    6. Numbers, Infinity and Computation
      Extract 1: Numbers 
      Extract 2: Aleph Zero The First Transfinite
      Extract 3: In Search Of Aleph-One
      Extract 4: Transcendental Numbers

    7. Kolmogorov Complexity and Randomness
      Extract 1:Kolmogorov Complexity 

    8. The Algorithm of Choice

    9. Gödel’s Incompleteness Theorem 

    10. Lambda Calculus
      Part II Bits, Codes and Logic

    11. Information Theory 

    12. Splitting the Bit 

    13. Error Correction 

    14. Boolean Logic 
      Part III Computational Complexity

    15. How Hard Can It Be?
      Extract 1: Where Do The Big Os Come From

    16. Recursion
      Extract 1: What Is Recursion
      Extract 2: Why Recursion

    17. NP Versus P Algorithms
      Extract 1: NP & Co-NP
      Extract 2: NP Complete

‘’‘’’

’

‘’

→→→

“”

–‘’

fig5

’