Artwork

Content provided by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
Player FM - Podcast App
Go offline with the Player FM app!

#116 The Smallest Possible Programming Language

11:46
 
Share
 

Manage episode 362179044 series 2709740
Content provided by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.

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


  continue reading

138 episodes

Artwork
iconShare
 
Manage episode 362179044 series 2709740
Content provided by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by David Kopec, Rebecca Kopec, David Kopec, and Rebecca Kopec or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.

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


  continue reading

138 episodes

All episodes

×
 
Loading …

Welcome to Player FM!

Player FM is scanning the web for high-quality podcasts for you to enjoy right now. It's the best podcast app and works on Android, iPhone, and the web. Signup to sync subscriptions across devices.

 

Quick Reference Guide