https://jinerx.github.io/tags/computation-theory/Recent content in Computation Theory on JinerX blogHugo -- gohugo.ioen-us© 2026 Jędrzej SajnógFri, 06 Mar 2026 20:00:47 +0100https://jinerx.github.io/learning_log/introduction-to-turing-machines/Fri, 06 Mar 2026 20:00:47 +0100https://jinerx.github.io/learning_log/introduction-to-turing-machines/<p>Here we&rsquo;re going to cover the very basics of what are turing machines and what they are used for. To understand this post it&rsquo;s best to be familiar with finite automata DFAs, NFAs, regular languages and context free grammars.</p> <h2 class="relative group">Motivation <div id="motivation" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#motivation" aria-label="Anchor">#</a> </span> </h2> <p>We as programmers want to use mathematics to study algorithms efficiently, but for that we need a formal mathematical notion of what an algorithm is. Additionally we want a way to figure out if a problem is computable - does there exist an algorithm solving a problem. Because of that we need some sort of mathematical entity where the notion of algorithms makes formal sense and which allows us to analyze those algorithms. This mathematical entity is the <strong>Turing Machine (TM)</strong>.</p>