Theory of Computation Course Description This course emphasizes computability and computational complexity theory.

This section includes 26 PDFs and 26 PPT files.

Computation process: Begin at start state, read input symbols, follow corresponding transitions, Accept if end with accept state, Reject if not. Examples: 01101 → Accept 00101 → Reject

Description: In this lecture, Dr. Bell introduces the theory of computation and explains some aspects of computational thinking. Programming languages are discussed, with an emphasis on basic Python …

Readings This course is taught using Professor Sipser’s textbook: Sipser, Michael. Introduction to the Theory of Computation. 3rd ed. Cengage Learning, 2012. ISBN: 9781133187790. We will cover …

18.S191 | Fall 2020 | Undergraduate Introduction to Computational Thinking Course Description This is an introductory course on computational thinking. We use the Julia programming language to …

18.435J | Fall 2003 | Graduate Quantum Computation Course Description This course provides an introduction to the theory and practice of quantum computation.

It aims to provide students with an understanding of the role computation can play in solving problems and to help students, regardless of their major, feel justifiably confident of their ability to write small …

Introduction to Neural Computation Course Description This course introduces quantitative approaches to understanding brain and cognitive functions. Topics include mathematical description of neurons, …

Introduction to Numerical Analysis Course Description This course analyzed the basic techniques for the efficient numerical solution of problems in science and engineering. Topics spanned root finding, …