2020 Fundamentals of Computing

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Undergraduate major in Computer Science
Instructor(s)
Murata Tsuyoshi 
Course component(s)
Lecture
Mode of instruction
 
Day/Period(Room No.)
Tue3-4(W934)  Fri3-4(W934)  
Group
-
Course number
CSC.T241
Credits
2
Academic year
2020
Offered quarter
1Q
Syllabus updated
2020/3/24
Lecture notes updated
-
Language used
Japanese
Access Index

Course description and aims

This course covers the mathematical concepts and theories related to computer science, which are based on the fundamentals learned in Foundations of Computer Science.
The principle of computing and computing models are viewed from various angles to reveal the essence of calculation.

Student learning outcomes

At the end of this course, students will be able to deal with Turing Machine, the recursive function, the lambda calculus, and the computability theory.

Keywords

Turing Machine, recursive function, lambda calculus, computability theory

Competencies that will be developed

Specialist skills Intercultural skills Communication skills Critical thinking skills Practical and/or problem-solving skills

Class flow

Based on lecture sessions followed by mid-term and final exams.

Course schedule/Required learning

  Course schedule Required learning
Class 1 Turing Machine 1 : Introduction to Turing machine After each lesson, review what you learned. Use the exercise problems in the textbook.
Class 2 Turing Machine 2 : Binary coding Specified in the class.
Class 3 Turing machine 3 : Universal Turing machine Specified in the class.
Class 4 Turing machine 4 : Computability Specified in the class.
Class 5 Recursive function 1 : Introduction to recursive function Specified in the class.
Class 6 Recursive function 2 : Data expression using Gödel number Specified in the class.
Class 7 Mid-term exam Specified in the class.
Class 8 Recursive function 3 : Computability of recursive function Specified in the class.
Class 9 Recursive function 4: Equivalence between recursive function and computability Specified in the class.
Class 10 Lambda calculus 1 : Introduction to lambda calculus Specified in the class.
Class 11 Lambda calculus 2 : Data expression using lambda term Specified in the class.
Class 12 Lambda calculus 3 : Computability of lambda calculus Specified in the class.
Class 13 Summary Specified in the class.
Class 14 Final exam Specified in the class.

Textbook(s)

Osamu Watanabe, Naoki Yonezaki. "Introduction to Theory of Computing". Nippon Hyoron Sha Co. Ltd. (Japanese)

Reference books, course materials, etc.

None

Assessment criteria and methods

Students' course scores are based on quizzes (20%), mid-term exam (40%) and final exam (40%).

Related courses

  • GRE.C101 : Foundations of Computer Science I
  • GRE.C102 : Foundations of Computer Science II

Prerequisites (i.e., required knowledge, skills, courses, etc.)

Students must have successfully completed Foundations of Computer Science I and II, or have equivalent knowledge.

Page Top