Understanding Computation: The Basics of Program Sequences (Part 01) 💻
Discover how computation is modeled as a sequence of program snapshots, leading to the final terminal state. Perfect for beginners exploring the fundamentals of the Theory of Computation!
vkedco
862 views • Sep 30, 2011
About this video
1. Sequences of program snapshots
2. Computation of a program P is a finite sequence of program snapshots where the last snapshot is terminal and each subsequent snapshot can be computed from the previous snapshot with the snapshot successor function
3. Two properties of computation is determinism and finiteness
4. Answering a justifiable critique of the finiteness of computation
5. What do programs compute?
6. What do programs do if there are more or fewer arguments than necessary?
7. Class home page is at http://vkedco.blogspot.com/2011/08/theory-of-computation-home.html
8. Video narration: Vladimir Kulyukin
2. Computation of a program P is a finite sequence of program snapshots where the last snapshot is terminal and each subsequent snapshot can be computed from the previous snapshot with the snapshot successor function
3. Two properties of computation is determinism and finiteness
4. Answering a justifiable critique of the finiteness of computation
5. What do programs compute?
6. What do programs do if there are more or fewer arguments than necessary?
7. Class home page is at http://vkedco.blogspot.com/2011/08/theory-of-computation-home.html
8. Video narration: Vladimir Kulyukin
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
862
Likes
6
Duration
11:39
Published
Sep 30, 2011
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.