1. What does the Church-Turing Thesis tell us? 2. What is a Turing machine and how is it related to Automata Theory? 3. List and briefly describe the three elements of logical structure in algorithms, as shown by Bhm and Jacopini. 4. What are pseudocode and flowcharts and how are they used to describe algorithms? 5. Summarize the criteria that should be met by linear sequences in algorithms.