3.1, due Friday Sep 29

Difficult:

I don't quite understand how to make the jump from def 3.1.15 to the actual transition matrices shown in examples 3.1.16 and 18. Setting up those matrices I'd like to see.

Application:

Establishing the existence of data structures as mathematical graphs, much like having a formula for the master theorem to evaluate recursion, will allow us to prove things and show things about the theory of computer science. It's so odd (but good) that a math class is teaching me more about CS theory than several semesters of CS classes themselves.

Comments

Post a Comment

Popular posts from this blog

8.1, due Nov 27 17

Difficult: The hardest part was following all of the integrals going on. The idea of fourier transforms is interesting, but I don't know how well I'll actually be able to follow it. Also, how is having a basis for only a subset of F make a suitable basis for all of the functions/signals we care about? Application: I've seen some of what DFT/FFTs can do, and it's super cool. I'm excited to see how we can apply this to audio and visual conversions!
Read more

8.6, due Friday 12/8

Difficult: Honestly, this whole thing is a bit fuzzy to me. I'm not quite sure how it works. I feel like I won't fully understand until I do a lab on it. Application: well, the picture of the mandrill was interesting. How sure are we, though, that this is how the FBI does fingerprints?
Read more

8.2 due wed 11/28

Difficult: Why is x_l = l(delta)? (top of pg 293). Also, I think that we could have used just a bit more explanation on what DFT/FFT's are. Application: In general, the DFT seems really cool based on what I've seen of Michael's pictures from Physics and such, but I can't seem to understand how exactly they work.
Read more