I'm beginning to learn that there's another phrase that incites just as much fear and dread into my heart: "the reader may enjoy proving this as an exercise." This is the sign of an extremely accomplished (but also somewhat sick and perverted) theoretician.
Wednesday, October 27, 2010
Dreaded Words
There are certain phrases that are bound to produce fear in the heart of any mortal human being. For instance, no parent wants to hear the words "Do you remember how Kevin's arm used to bend like this?" It's a bad sign. It's also never good when a distant acquaintance calls you up, pretending to have a sudden, profound interest in your life. You know they really just you to spam all your email contacts with a "great internship opportunity" or (even worse) set you up with a "tall friend."
I'm beginning to learn that there's another phrase that incites just as much fear and dread into my heart: "the reader may enjoy proving this as an exercise." This is the sign of an extremely accomplished (but also somewhat sick and perverted) theoretician.
I'm beginning to learn that there's another phrase that incites just as much fear and dread into my heart: "the reader may enjoy proving this as an exercise." This is the sign of an extremely accomplished (but also somewhat sick and perverted) theoretician.
Friday, October 22, 2010
Steely-Eyes
Although I am a computer scientist, I wouldn't consider myself to be entirely introverted. I can work alone on a project for 20 hours straight until 5am, but I also have been guilty of postponing studying in favor of socializing. This inclination to treat my associates as human beings has, unfortunately, given me a lack of understanding to some of the more complicated aspects of a computer scientist.
Let me give you an example: The Computer Scientist's Gaze.
When individual
It's easy to see why you don't want to catch someone's gaze when you're into computer science. It's not that we hate each other's work, it's just that we've spent so much time trying to convince ourselves that we're actually doing something worthwhile (instead of just tweaking parameters and hoping for marginal success stories to publish).
Let me give you an example: The Computer Scientist's Gaze.
When individual
A matches the searching gaze of individual B (given that A and B are elements of the set of all Computer Scientists), this process is a mere formality for what must come next. A must always submit themselves to an endless pontification from B about B's work, its complex theory, and its possibility to solve the most complex of problems (WLOG, we can assume these problems include—but are not limited to—world peace, starving children in Ethiopia, and any religious debate). Through the course of this dialogue, A will also be required to understand several sloppily-written proofs on the back of a greasy napkin, providing some level of feedback, if only to suggest that "It would be easier to understand for a reader less knowledgeable than I if you changed the variable r here to be the Greek symbol ρ." By the end of the mind-numbing conversation, A will also have promised B (upon penalty of another painfully boring lecture) that he or she will attend the next group meeting, lecture series, and sit in at least half of the remaining periods of their graduate course.It's easy to see why you don't want to catch someone's gaze when you're into computer science. It's not that we hate each other's work, it's just that we've spent so much time trying to convince ourselves that we're actually doing something worthwhile (instead of just tweaking parameters and hoping for marginal success stories to publish).
Monday, September 13, 2010
Parallel Algorithms part XXX
Disclaimer: If you have not taken a course in complexity theory of computation (or if you have a life), you might not find this post all that entertaining. Just be warned.
I'm in a Parallel Algorithms Theory class right now, and since I've already taken a few classes in parallel programming and had lots of experience, I thought it might be insightful. Unfortunately, I learned the truth about the class today and am still trying to find the missing link to reality.
It seems that there are three general steps to creating a "work-time optimal" algorithm. These are, in order:
I'm in a Parallel Algorithms Theory class right now, and since I've already taken a few classes in parallel programming and had lots of experience, I thought it might be insightful. Unfortunately, I learned the truth about the class today and am still trying to find the missing link to reality.
It seems that there are three general steps to creating a "work-time optimal" algorithm. These are, in order:
- Assume an extremem number of processors, such that
p>>n. This works best for doing something trivial, such as searching a sorted array for a given element.ncan be any arbitrary number between one and the size of an integer (around 4 billion). - Create a convoluted algorithm such that:
- The number of parallel steps is very small (Try getting close to
O(log log n)) - The number of steps required to orchestrate parallelization and setup is significantly large (preferably close to
n2) - Hand-wave and use several mathematical approximations with Big-Oh to show that your new algorithm is actually constant time
O(1).
Once this has been done, publish your results and teach a Parallel Algorithms course.
Friday, August 27, 2010
Everything's Bigger in Texas
Well, I've been silent on the blogging for some time, but since I'll be away from home for a while, I figured I'd start it back up.
This past summer, I decided I wasn't living life "on the edge" enough, so within a ten-day time period, I bought my first car, graduated from BYU (a two-day affair), drove 22+ hours to an entirely new state (and almost country), and started graduate school at the University of Texas at Austin. Oh. And within 14 days, I had caused $1400 worth of damage to an otherwise steal-of-a-deal car.
I rather like it here. I didn't really have many expectations, other than the oft-repeated statement of pride, "Everything's Bigger in Texas," so I was pleasantly surprised.
First, everything is bigger in Texas. I ordered a glass of water at a local Tex-Mex restaurant ("it's authentic," Alyse's family said—which begs to question the authenticity of a food type that contains the state it's cooked in and the country from which it is influenced in its title), and it really was bigger. You can see the straw barely poking up over the top on the back side: I only needed refills once instead of the usual 6 or 7 times. I'm glad I'm not in Germany.
I also like the openness of Austin. Since Alyse served a mission here a few months ago, she drove down with me and stayed with her family. Taking her home after we'd finished our day's festivities, we drove through the countryside. I would have parked my car, got out and enjoyed the full moon and big farms (or at least rolled down my window to take in the smells) had it not been for the 80 degrees and 95% humidity at 11:30 at night.
Mostly, I love everybody's inner yee-haw. Walking from the institute building to school today, I saw a group of workers including a Hispanic man wearing cowboy boots. He's real Tex-Mex.
Maybe I'll grow to love this place. And maybe, during the cooler months this "winter," I'll even wear my cowboy boots once or twice. Just for kicks.
This past summer, I decided I wasn't living life "on the edge" enough, so within a ten-day time period, I bought my first car, graduated from BYU (a two-day affair), drove 22+ hours to an entirely new state (and almost country), and started graduate school at the University of Texas at Austin. Oh. And within 14 days, I had caused $1400 worth of damage to an otherwise steal-of-a-deal car.
I rather like it here. I didn't really have many expectations, other than the oft-repeated statement of pride, "Everything's Bigger in Texas," so I was pleasantly surprised.
I also like the openness of Austin. Since Alyse served a mission here a few months ago, she drove down with me and stayed with her family. Taking her home after we'd finished our day's festivities, we drove through the countryside. I would have parked my car, got out and enjoyed the full moon and big farms (or at least rolled down my window to take in the smells) had it not been for the 80 degrees and 95% humidity at 11:30 at night.
Mostly, I love everybody's inner yee-haw. Walking from the institute building to school today, I saw a group of workers including a Hispanic man wearing cowboy boots. He's real Tex-Mex.
Maybe I'll grow to love this place. And maybe, during the cooler months this "winter," I'll even wear my cowboy boots once or twice. Just for kicks.
Thursday, December 3, 2009
Tweeting (and Old Men)
When Bishop Burton talked about “tweeting” in Tuesday’s campus devotional, I was only mildly surprised as the girl sitting next to me confessed she didn't know what Twitter was. It’s impressive, especially for how old they are, that the leaders of the Church are so in-touch with the latest technology. Texting and blogging are regularly mentioned in General Conference, even from the older members of the Quorum of the Twelve Apostles or First Presidency. I find this especially fascinating when my own father—a computer science professor—occasionally demonstrates ignorance to such developments. On the other hand, the horrible encounters I frequently had with the Church's email on my mission make me question the reality of its progression. I especially get a kick out of Church leaders like Brother VanDenBerghe who enthusiastically support electronic greeting cards as “a quick and easy way to let [a sick friend] know [they are] concerned.” Now that I think about it, isn't it somewhat ironic that Bishop Burton decided the best format for the tweets from his latest General Conference talk was in twenty-five pages of printed text?
Tuesday, December 1, 2009
"Am I Addicted?"
Sometimes I wonder if I have an addiction. In reference to this self-proclaimed obsession, I told myself a few months ago, “If I can find a girl with whom I enjoy spending more time than I do with [my addiction], I’ll get married to her quick.” Dr. K’s Ensign article gives several factors for identifying an addictive tendency, and quite a few of them fit. I do “play” compulsively, often for longer periods than I had planned. Frequently, I “have difficulty stopping,” and even when I am not “playing,” I find myself “[obsessing] about the game, plotting and planning [my] next opportunity to play.” Occasionally, my schoolwork suffers because of the time and energy I spend with this activity, and my sleep patterns have changed since I “became involved.” Perhaps I should seek help or counseling, but I don’t think my research mentor would approve—after all, the more time I spend on this “addiction,” the closer we’ll get to another publication.
Although perhaps this “addiction” is worse than I pretend...
Although perhaps this “addiction” is worse than I pretend...
Thursday, November 19, 2009
Swine flu? Bah. What about real viruses?
I’ve been extremely frustrated with my Internet connection for the last few months. Apple Care blamed the problem on my ISP, and my ISP told me it's a problem with my computer. To make matters worse, obtaining relevant support from tech guys is nearly impossible (most of them aren’t native English speakers and the ones that do speak clearly are incredibly incompetent). So when I finally got a guy on the phone last night who actually knew what he was talking about, I was incredibly relieved. After spending a long time troubleshooting, he informed me I probably had a virus causing a "DNS flood attack." Internet security has changed a lot in the past few years. Before, it was sufficient to not download strange files and avoid a pornography or gambling addiction, but now you have to worry about strange Internet security threats and your wife becoming addicted to online chess. There’s no telling what will happen in the next twenty years.
Subscribe to:
Posts (Atom)

