In this lecture video, we explore the idea of Turing Machines that instead of accepting and rejecting, take input and produce output on the tape. We develop a Turing Machine that takes two unary numbers (base 1 numbers) and outputs their addition, by leaving it on the tape upon halting.
Time Stamps:
0:00 Lecture begins
0:20 What are transducers, reasons why we may consider them.
6:50 Designing a transducer (Turing Machine) that adds two unary numbers, what are unary numbers, and more!
22:43 Giving the transition table for the transducer
30:24 Summary
31:08 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Tor Asbjørn
Eric R
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
4