The Turing Machine
In this video, we discuss a formal model for computation: The Turing machine. The Turing machine combines a finite automaton (the computer program) with an infinite tape (the memory). In principle, the Turing machine is computationally powerful, it can anything that can be computed with the best available hardware and software. At the same time, the Turing machine is simple, and easy to completely understand. We say that a computer system is Turing complete if it is computationally as powerful as a Turing machine. In the video, we also discuss some other machine models, in particular the randomized Turing machine, and the RAM machine.
Watch video The Turing Machine online without registration, duration hours minute second in high quality. This video was added by user Computational Thinking 14 December 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 1,133 once and liked it 18 people.