CIS

Q1: As a computing agent, in what ways is a Turing machine different from a human being? Are any features Turing machines lack important for understanding what humans can express or compute algorithmically?

Q2: Think about a variation on a Turing machine that does not have an infinite tape. Instead, its tape is N cells long. Can you think of problems such a machine could not solve, that could be described algorithmically? ( at least 100 Word).

Q3: Which phase of the compiler seems easiest to you? Which seems most difficult? Why? ( at least 100 Word).

Q4: What does it mean for the field of computer science that there are unsolvable problems? ( at least 100 Word).