#116 The Smallest Possible Programming Language
Kopec Explains Software - A podcast by David Kopec, Rebecca Kopec

Categories:
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. Show Notes Episode 11: What is a Programming Language? Brainf... via Wikipedia Programming Languages: Principles and Paradigms by Allen Tucker and Robert Noonan via Amazon Follow us on Twitter @KopecExplains. Theme “Place on Fire” Copyright 2019 Creo, CC BY 4.0 Find out more at http://kopec.liveRead transcript