Police Detective Thorn: "Soon they'll be breeding us like cattle! You've got to 
warn everyone and tell them! Turing machines are made of people! You've got to 
tell them! Turing machines are people!" 

Be one with the Machine. Come to Julie and Andrew's

         _____         _             __  __         _    _             
        |_   _|  _ _ _(_)_ _  __ _  |  \/  |__ _ __| |_ (_)_ _  ___ ___
--------- | || || | '_| | ' \/ _` | | |\/| / _` / _| ' \| | ' \/ -_|_-<-------
          |_| \_,_|_| |_|_||_\__, | |_|  |_\__,_\__|_||_|_|_||_\___/__/
                             |___/                                     
                   __,              , _                      
                   /  |   ,_   _    /|/ \ _  _      |\  _ |   
                  |   |  /  | |/     |__/|/ / \_|/\_|/ |/ |   
                   \_/\_/   |/|_/    |   |_/\_/ |_/ |_/|_/o   
                                               (|            
                                                          
                     ____   __    ____  ____  _  _
                    (  _ \ /__\  (  _ \(_  _)( \/ )
                     )___//(__)\  )   /  )(   \  /
                    (__) (__)(__)(_)\_) (__)  (__) 

-------------------------------------------------------------------------------

The goal of this party is to construct various Turing machines out
of people and perform computations. We will be starting out the evening
with simple Turing machines like a tape-cleaner[1], a busy beaver[2], 
progressing to more complicated machines as the night goes on. Is it possible 
to construct a Universal Turing Machine purely[3] out of (very geeky, but 
you knew that already) people? Come to the party and find out!

The details: 
When: Saturday, June 2nd, > 8PM
Where: location to be decided. (location offers welcome, please contact 
     ) 
Why: This has absolutely nothing to do with the fact that Julie might
     be teaching a class on theory of computation this summer. Don't even 
     think of it. 
What to bring: yourself, your friends, your old CS textbooks and/or 
     designs for Turing machines you might want to make, food or beverages 
     (if you feel like it) 

Have you ever dreamed of writing a 1 or 0 then moving left or right depending
on your input? Perhaps you've even aspired to represent a 1 or a 0 yourself? 
Dream in vain no longer. Now is your chance! 

Special prizes will be awarded to all guests who can solve the halting
problem, or prove or disprove that P=NP! 

Bring your friends! You know you want it.  

-Julie and Andrew  

[1]An elderly aunt has passed away.  In her estate you find a collection of
used Turing machine tapes.  Great! you think to yourself, but however will
I get rid of all the symbols on them?  Fortunately, each tape has only a
single non-blank, so you design the simplest possible machine to clean the tape
and then halt.

[2]No CS assignment is currently due and you want to keep the university
Turing machine tape from getting dusty, so you write the Turing machine with n
states that runs as long as possible and then halts, starting from a blank
tape. 

[3] Well, we may be willing to use some props, such as instruction cards,
butcher paper, or string.  In fact, if you have any non-electronic device
(such as tinkertoy, zometool, or lego) that you feel would aid in the
construction of a computer[4], feel free to bring it.

[4]Cellular automata are fine too...
.........
..#......
...##....
..##.....
.........