How small can a programming language be and still be a programming language? In order for a programming language to be able to compute the same sorts of problems as any other language it must be Turing-complete. Amazingly, there is a programming language that has just eight commands, represented by eight single symbols, that is Turing-complete. In this episode we describe what it means to be Turing-complete and how this tiny language does it.
<h2>Show Notes</h2>
<ul>
<li><a href="https://pnc.st/s/kopec-explains-software/f617cccb56734a53/what-is-a-programming-language-" rel="nofollow">Episode 11: What is a Programming Language?</a></li>
<li><a href="https://w.wiki/STN" rel="nofollow">Brainf...</a> via Wikipedia</li>
<li><a href="https://amzn.to/3Nyn9sZ" rel="nofollow">Programming Languages: Principles and Paradigms by Allen Tucker and Robert Noonan</a> via Amazon</li>
</ul>
Follow us on Twitter <a href="https://twitter.com/kopecexplains" rel="nofollow">@KopecExplains</a>.
Theme “Place on Fire” Copyright 2019 <a href="www.creo-music.com" rel="nofollow">Creo</a>, <a href="https://creativecommons.org/licenses/by/4.0/" rel="nofollow">CC BY 4.0</a>
Find out more at http://kopec.live<a href="https://pnc.st/s/kopec-explains-software/65604d0b/the-smallest-possible-programming-language/transcript">Read transcript</a><hr>

Classic Episode: What is an Operating System? (Remastered)

We make software-related technical topics intelligible. We aim to help you develop an intuitive understanding of each subject, instead of emphasizing formal definitions. Join us as we learn about the wide world of software.