2025 (Current Year) Faculty Courses School of Computing Undergraduate major in Computer Science
Fundamentals of Computing
- Academic unit or major
- Undergraduate major in Computer Science
- Instructor(s)
- Tsuyoshi Murata
- Class Format
- Lecture (Face-to-face)
- Media-enhanced courses
- -
- Day of week/Period
(Classrooms) - 3-4 Tue (W2-402(W242)) / 3-4 Fri (W2-402(W242))
- Class
- -
- Course Code
- CSC.T241
- Number of credits
- 200
- Course offered
- 2025
- Offered quarter
- 1Q
- Syllabus updated
- Mar 31, 2025
- Language
- Japanese
Syllabus
Course overview and goals
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.
Course description and aims
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
- Specialist skills
- Intercultural skills
- Communication skills
- Critical thinking skills
- Practical and/or problem-solving skills
Class flow
After in-person lectures and exercises, mid-term exam and final exam will be done.
Course schedule/Objectives
| Course schedule | Objectives | |
|---|---|---|
| Class 1 | Orientation |
After each lesson, review what you learned. Use the exercise problems in the textbook. |
| Class 2 | Turing Machine 1 : Introduction to Turing machine |
Specified in the class. |
| Class 3 | Turing Machine 2 : Binary coding |
Specified in the class. |
| Class 4 | Turing machine 3 : Universal Turing machine |
Specified in the class. |
| Class 5 | Turing machine 4 : Computability |
Specified in the class. |
| Class 6 | Recursive function 1 : Introduction to recursive function |
Specified in the class. |
| Class 7 | Recursive function 2 : Data expression using Gödel number |
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 | Relation of turing machine, recursive function, and lambda calculus |
Specified in the class. |
| Class 14 | Summary / Final exam |
Specified in the class. |
Study advice (preparation and review)
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Textbook(s)
Osamu Watanabe, Naoki Yonezaki. "Introduction to Theory of Computing". Nippon Hyoron Sha Co. Ltd. (Japanese)
Reference books, course materials, etc.
None
Evaluation methods and criteria
Students' course scores are based on exercises (40%), mid-term exam (30%), and final exam (30%).
Related courses
- GRE.C101 ： Foundations of Computer Science I
- GRE.C102 ： Foundations of Computer Science II
Prerequisites
Students must have successfully completed Foundations of Computer Science I and II, or have equivalent knowledge.
Other
For more information, please refer to the following site.
http://www.net.c.titech.ac.jp/lecture/comp/