1. CS154 Formal Languages and Computability
Thaddeus Aid
Department of Computer Science
San Jose State University
Spring 2016
Creative Commons Attribution-ShareAlike 4.0 International License

2. Creative Commons Attribution-ShareAlike 4.0 International License
Homework 1
There are 3 basic models of computation. FA, RE, and the Turing Machine. Are they all equal, why use one over another? What are their roles in understanding problems and how to solve them?
Contrast computational models with emphasis on appropriate roles in computation.
2500 words
Harvard style citations are required (APA style, check out RefWorks, or other citation software) – they are also not part of your word count.
Of course spelling and grammar count.
Scoring – 7 points content – 3 points style/clarity/formatting
Due before 03/18/ :59
Creative Commons Attribution-ShareAlike 4.0 International License

3. Creative Commons Attribution-ShareAlike 4.0 International License
Chalk Talk!
Will be updated with book page numbers
Creative Commons Attribution-ShareAlike 4.0 International License