It has almost made me forget my bus fiasco getting here. I've had terrible luck with buses lately - I spent four hours getting to Metronome Ballroom and back last Friday when it should have taken two, and two hours getting from Seattle airport to campus when it should have taken one; and I gave up on the bus that would take me to my recalcitrant car on Friday afternoon, accepting a ride from a stranger instead (a nice one ... with a Prius ...). If public transit were more reliable, maybe people wouldn't be so wedded to their cars! ...
On a more positive note, I very much enjoyed crossing the Bay Bridge in a bus - I was several feet higher than the drivers of even the most monstrous SUVs, and had amazing views of Coit Tower, Golden Gate, and even Oakland's human waste processing plant (from now on I'll know precisely where that odious smell is coming from when I'm on the freeway :~)), when in my low car I'd only see the bridge's wall (or I'd be too busy driving to see anything at all). I was able to pick out the waste processing plant from the plane this afternoon, too.
There were high cirrus and cirrocumulus clouds over the Bay Area, so for a good half hour I had lovely views of the cities and hills beyond from my plane window. After we rose above the clouds, I saw a glory around the plane's shadow - a compact rainbow no more than 10 degrees in diameter. There was another glory about 30 degrees to the right of the primary one - an effect I hadn't seen before, and can't seem to find any information about. (Anyone out there know about supplemental glories? It had the same circular shape and all, just not the plane's shadow in the center.) And finally, as we descended into Seattle I saw the bottom half of a 42-degree rainbow over downtown. Lovely! I took pictures of much of this, and if any of them are any good I'll post them later.
This week, in addition to frantically finishing my Programming Languages project, grading 170 homeworks, reading for my Development in the Third World class, and enjoying this little retreat, I will run a passel of user studies, starting at 8:30am tomorrow! I'll be back in Berkeley next Saturday.
One last thing - I was wrestling with this interesting problem for Computability and Complexity earlier today, and thought I'd share:
"Ann and Bob are sitting at a table. On the table there is a square tray with four glasses at the corners. Bob's goal is to turn all the glasses either right-side up or upside down. However, Bob is blindfolded and he is wearing mittens. He does not know the initial state of the glasses. If they are initially all turned the same way, then Bob automatically wins. Otherwise, Bob may grab one or two glasses and turn them over. Because of the blindfold and mittens he cannot see or feel whether the glasses he grabs are right-side up or upside down. He can, however, choose whether to grab adjacent glasses or diagonally opposite glasses. If the glasses are all turned the same direction, Ann announces that Bob has won. Otherwise, Ann may rotate the tray, just to make Bob's goal harder. Then the game repeats, with Bob, in each of his moves, either turning one glass or turning two adjacent glasses or turning two diagonally opposite glasses, and Ann, in each of her moves, rotating the tray by any amount. Find the shortest sequence of actions by which Bob is guaranteed to win the game, no matter what the initial state and no matter how Ann plays."