PLAY PODCASTS
#116 The Smallest Possible Programming Language
Episode 116

#116 The Smallest Possible Programming Language

Brainf*** is a really small Turing-complete programming language.

Kopec Explains Software · David Kopec, Rebecca Kopec

May 1, 202311m 46s

Audio is streamed directly from the publisher (pdcn.co) as published in their RSS feed. Play Podcasts does not host this file. Rights-holders can request removal through the copyright & takedown page.

Show Notes

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

Follow us on Twitter @KopecExplains.

Theme “Place on Fire” Copyright 2019 Creo, CC BY 4.0

Find out more at http://kopec.live

Read transcript