{"id":195065,"date":"2025-06-18T18:27:10","date_gmt":"2025-06-18T18:27:10","guid":{"rendered":"https:\/\/www.europesays.com\/uk\/195065\/"},"modified":"2025-06-18T18:27:10","modified_gmt":"2025-06-18T18:27:10","slug":"programmers-guide-to-theory-turing-thinking","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/uk\/195065\/","title":{"rendered":"Programmer’s Guide To Theory – Turing Thinking"},"content":{"rendered":"\n\n\t\tArticle Index
\n\t<\/tr>\n\n\n\t\tProgrammer’s Guide To Theory – Turing Thinking<\/a>\n\t\t<\/td>\n<\/tr>\n\n\n\t\t\t\tTuring Machines and Finite State Machines<\/a>\n\t\t\t\t<\/td>\n<\/tr>\n\n\n\t\t\t\tFinite State Turing<\/a>\n\t\t\t\t<\/td>\n<\/tr>\n

Page 1 of 3<\/p>\n

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.<\/p>\n


\n
\nA Programmers Guide To Theory
<\/strong>
\nNow available as a paperback and ebook from Amazon<\/a>. <\/p>\n

\"cover600\"<\/p>\n


\nContents <\/p>\n

    \n
      <\/p>\n
    1. What Is Computer Science?
      Part I What Is Computable?<\/strong><\/li>\n

      <\/p>\n

    2. What Is Computation?<\/li>\n

      <\/p>\n

    3. The Halting Problem <\/a><\/li>\n

      <\/p>\n

    4. Finite State Machines
      Extract 1:       Finite State Machines
      <\/a>Extract 2:       Turing Thinking <\/a>***NEW!<\/li>\n

      <\/p>\n

    5. Practical Grammar<\/a><\/li>\n

      <\/p>\n

    6. Numbers, Infinity and Computation
      Extract 1:       Numbers\u00a0
      <\/a>Extract 2:       Aleph Zero The First Transfinite<\/a>
      Extract 3:       In Search Of Aleph-One<\/a>
      Extract 4:       Transcendental Numbers<\/a> <\/li>\n

      <\/p>\n

    7. Kolmogorov Complexity and Randomness
      Extract 1:      Kolmogorov Complexity<\/a>\u00a0<\/a><\/li>\n

      <\/p>\n

    8. The Algorithm of Choice<\/a><\/li>\n

      <\/p>\n

    9. G\u00f6del\u2019s Incompleteness Theorem<\/a>\u00a0<\/li>\n

      <\/p>\n

    10. Lambda Calculus<\/a>
      Part II Bits, Codes and Logic<\/strong><\/li>\n

      <\/p>\n

    11. Information Theory\u00a0<\/a><\/li>\n

      <\/p>\n

    12. Splitting the Bit<\/a>\u00a0<\/li>\n

      <\/p>\n

    13. Error Correction\u00a0<\/a><\/li>\n

      <\/p>\n

    14. Boolean Logic<\/a>\u00a0
      Part III Computational Complexity<\/strong><\/li>\n

      <\/p>\n

    15. How Hard Can It Be?
      Extract 1:       Where Do The Big Os Come From <\/a><\/li>\n

      <\/p>\n

    16. Recursion
      Extract 1:       What Is Recursion <\/a>
      Extract 2:       Why Recursion<\/a><\/li>\n

      <\/p>\n

    17. NP Versus P Algorithms
      Extract 1:       NP & Co-NP <\/a>
      Extract 2:       NP Complete <\/a><\/li>\n

      \n<\/ol>\n<\/ol>\n

      <\/p>\n

      \u2018\u2019\u2018\u2019\u2019<\/p>\n

      \u2019<\/p>\n

      \u2018\u2019<\/p>\n

      \u2192\u2192\u2192<\/p>\n

      \u201c\u201d<\/p>\n

      \u2013\u2018\u2019<\/p>\n

      \"fig5\"\/
      <\/p>\n

      \u2019<\/p>\n

      <\/td>\n","protected":false},"excerpt":{"rendered":"Article Index Programmer’s Guide To Theory – Turing Thinking Turing Machines and Finite State Machines Finite State Turing…\n","protected":false},"author":2,"featured_media":195066,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3164],"tags":[49169,49174,49175,3284,49180,49167,49177,12,49172,49181,49164,49176,49166,49165,49171,49170,49168,49179,53,49178,16,15,49173],"class_list":{"0":"post-195065","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-computing","8":"tag-c","9":"tag-computer-book-reviews","10":"tag-computer-history","11":"tag-computing","12":"tag-developer-book-reviews","13":"tag-developer-news","14":"tag-joomla","15":"tag-news","16":"tag-php","17":"tag-programmer-news","18":"tag-programming-book-reviews","19":"tag-programming-history","20":"tag-programming-news","21":"tag-programming-tutorials","22":"tag-python","23":"tag-ruby","24":"tag-software-programmer-news","25":"tag-spreadsheets","26":"tag-technology","27":"tag-theory","28":"tag-uk","29":"tag-united-kingdom","30":"tag-visual-basic"},"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@uk\/114705782934607208","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/posts\/195065","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/comments?post=195065"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/posts\/195065\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/media\/195066"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/media?parent=195065"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/categories?post=195065"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/uk\/wp-json\/wp\/v2\/tags?post=195065"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}