Theory of Computation: What is Computation? (Part 01)

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