🚀 go-pugleaf

This week's speaker will be Dan Simon.  The meeting will be held in 
Wallberg 144 from 11:00-12:00 on Thursday, March 24. Dan says:

I plan to discuss "The Complexity of Perfect Zero Knowledge" by L. Fortnow.  
The result in this paper is that the complement of any perfect (or almost 
perfect) zero-knowledge language has a short interactive proof.  Don't worry
--I will be spending the first part of the talk explaining what interactive 
proofs and zero knowledge are, for those who have never seen them before (or 
who have but didn't bother to listen).  This paper gives me the opportunity to
discuss a variety of results and issues related to zero knowledge, the number 
and depth of which will depend on time constraints, general audience enthusiasm 
(snicker)  and the quality of food provided by the designated feeder.

Any volunteers for designated feeder?  Please let me know (nishi@theory).