Reading Assignment (Group)

o Reading Books, Internet, Magazine, Journals...... 2 (Please include as references)

o Description / Notes / Definition / Theorem / Proof ...... 2
o Example / Implementation...... 2
o Conclusion / Suggestion ...... 2
o Question and Answer..... 2
Xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
10. Other Models of Turing Machines Persons
 Minor Variations on the Turing Machine
Equivalence of Classes of Automata 3
Turing Machines with a Stay-Option 3
Turing Machines with Semi-Infinite Tape 3
The Off-Line Turing Machine 3
 Turing Machine with More Complex Storage
Multi tape Turing Machine 3
Multi dimensional Turing Machine 3
 Non Deterministic Turing Machine 3
 A Universal Turing Machine 3
 A Linear Bounded Automata 3

12. Limits of Algorithmic Computation

 Reducing One un-decidable Problem to Another 3

13 Other Models of Computation

 Post System 3
 Rewriting System 3

14 An Introduction to Computational Complexity

 Language Families and Complexity Classes 3

11. Computability
 Primitive Recursive Function Over N 3

Partial recursive functions and Turing Machine

 Turing Computable functions +
 Construction of the TM that can computer the Zero function Z 3
 Construction of the TM for computing - the successor function 3
 Construction of the TM for computing – the Projection function 3
 Construction of the TM for that can perform composition 3
 Construction of the TM for that can perform Recursion with example 3
 Construction of the TM for that can perform Minimization with example 3
 Other NP-Complete Problems and Use of NP-Completeness 3
Quantum Computation
 Quantum Computers and 3
 Church Turing Thesis 3
 Power of Quantum Computation 3