Today, we will look at formalising our model of computation, meaning, we will come up with abstract models to represent our notion of a computing device. We will consider two of the most popular, natural and powerful models, namely, circuits and finite automata.
In the latter half of the lecture, we will learn some basics of discrete probability, which we will need for our next lecture.
The notes for the models of computation are available here. The notes for the discrete probability lecture are from here.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment