Friday, May 2, 2008

Sec 6.4 for May 2

What was difficult?

Following some of the factoring methods was a bit hard. I had to read over the p-1 factoring algorithm and the Quadratic Sieve a bunch of times before I understood what was going on. Its interesting to look at how factoring algorithms evolve as we try to get closer and closer to an efficient algorithm.

Reflection:


Though it was only a brief mention the text talked about the building of a quantum computer. I dont know much about quantum computers or what they even are, but every time I hear it mentioned it is doing something amazing. For example, a quantum computer can sort in O(n) time or efficiently factor. I really hope talk about quantum computers at one point in class. And if one is ever built things would go a lot faster!

No comments: