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.
Смотрите видео The Turing Machine онлайн без регистрации, длительностью 07 минут 40 секунд в хорошем hd качестве. Это видео добавил пользователь Computational Thinking 15 Декабрь 2022, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 74 раз и оно понравилось людям.