What’s the smallest possible programming language that can still be used to solve real problems? Certainly, a candidate for that prize would be Brainf**k (BF), an esoteric programming language developed by Urban Müller in 1993. In this video we'll (briefly) explain what a Turing machine is and show that BF is Turing-complete by a textbook definition of the term. While it may not be absolute smallest possible Turing-complete programming language, it's pretty close.
This video is based on Chapter 1 of Computer Science from Scratch. Find out more about the book at:
https://computersciencefromscratch.com
You can find the code for this video on GitHub at:
https://github.com/davecom/ComputerScienceFromScratch
Download
0 formats
No download links available.
The Smallest Possible Programming Language | NatokHD