Aside: Turing computability and the cloud
Wednesday, February 09, 2011
3:35 PM
Aside: Turing computability and the cloud
Any graduate of Comp170 knows that there are computer programs "complex enough" that the only way to generate their output is to execute them. E.g., due to
Church's thesis
Undecidability
Comp170 also demonstrates that simpler programs can be analyzed and implemented flexibly, e.g., by a
State machine
Pushdown automaton (state machine with a stack)