Welcome, Guest Sign In | Sign Up | Help
Thank you for using Upcoming!
To help focus our efforts on core Yahoo! product experiences, we will discontinue Upcoming by 30th April 2013. You can find more details here
  • DETAILS & PHOTOS
(close)
  • Add Photos from

    Your photos will appear on this event page automagically in a little while!

Event Photos
Have a photo? Add it here
Perimeter Institute Public Events Series
Wednesday April 19, 2006 from 7:00pm - 9:00pm
Bloor Collegiate Institute
April 19, 2006
Toronto, Ontario M6H 1M9 Get Directions
Programming the Universe
Lecture by Seth Lloyd
MIT
The universe computes: every atom, electron, and elementary particle registers bits of information, and every time two particles collide those bits are flipped and processed. By ?hacking? the computational power of the universe, we can build quantum computers which store and process information at the level of atoms and electrons. This computational capacity underlies the generation of complex systems, and provides insight into the origin of life and its future.

Tickets:
Attendance is free, but tickets are required and will be available starting Monday, March 20th. Tickets can be reserved on-line at www.perimeterinstitute.ca or by phone at 519-883-4480. Please note that these events are explicitly tailored for the general public. No mathematical or scientific knowledge is necessary or assumed. Information on upcoming events can be found at www.perimeterinstitute.ca.
Doors open at 6:20 pm, and the lecture begins at 7:00 pm. Please be parked and take your seats in the auditorium by 6:45 pm. Due to demand, ticket holders arriving after 6:45 may be directed to the end of the waiting list.
Location:
Bloor Collegiate Institute, 1141 Bloor St W, Toronto.
Comments


Sign Up or Sign In to comment on this event!
Been there, done that?
(undo)
or
6 People saved this event. ...
3 Attended
3 Watched
Bloor Collegiate Institute


Tools
Upcoming Badges for Your Blog/Website | Groups | Developers API
Help
News Blog | Community Guidelines | FAQ | Contact Us | About Us