Hi guys,
Just so you know, we will be watching 2001: a space odyssey on Saturday night.
More details about the event can be found at http://www.facebook.com/event.php?eid=302974333051482.
All the best,
Ben
PS Nobody has yet guessed this weeks technology challenge correctly - first one to do so gets a £5 prize. I have copied the challenge and a clue below.
------------------------------------------------------------------------
Technology Competition: Challenge 2:
This weeks challenge is to determine what the code below does: def f(b):n=b.find('0');~n or exit(b);[m in[(n-j)%9*(n/9^j/9)*(n/27^j/27|n%9/3^j%9/3) or b[j]for j in range(81)]or f(b[:n]+m+b[n+1:]) for m in'%d'%5**18]
Once you have figured it out go to http://compsoc.dartoxia.com/answer/<ANSWER GOES HERE>.
Anyone (with a .ox.ac.uk email address) can sign up to the competition through the http://compsoc.dartoxia.com website, but only members can receive prizes.
Compsoc.dartoxia.com isn't connected to the compsoc network, and so you will need to make a new account to participate.
For more details about the competition see http://compsoc.net/technology_competition or contact committee@ox.compsoc.net
------------------------------------------------------------------------
Clue:
It is not PI, quicksort or a turing machine. Sample input for the code is copied below:
402705016603000080010008000700591040000307000020864007000900070040000608870402109