Friday, June 22, 2018 — 5:30 PM to Sunday, June 24, 2018 — 5:00 PM EDT
Three-day programing workshop
This three-day workshop covers an intense 17-hour curriculum designed to give beginners complete, basic programming skills to use in their studies or workplace. It is intended for everyone who wants to learn basics of programming and does not have an opportunity to do so as a part of their studies. Over the course of the workshop, participants will learn the Python programming language through lectures and hands-on sessions, supported by a team of mentors.
Thursday, June 21, 2018 — 9:40 AM to 4:00 PM EDT
The David R. Cheriton School of Computer Science is pleased to announce its inaugural Wes Graham Research Symposium & Computer Science Awards. The ceremony takes its name from James Wesley (Wes) Graham, a humble visionary known as the “father of computing” at the University of Waterloo and an academic who devoted his career to making the magic of computers available to everyone.
Friday, June 15, 2018 — 2:30 PM EDT
We're excited about the Spring convocation. The Faculty of Mathematics holds two ceremonies. If you don't see your degree here, please check Ceremony 1.
Following each ceremony, bring your families and guests to the Great Hall in the Student Life Centre (SLC) for photos and refreshments.
In the second ceremony, the following degrees will awarded:
Friday, June 15, 2018 — 10:00 AM EDT
We're excited about the Spring convocation. The Faculty of Mathematics holds two ceremonies. If you don't see your degree here, please check Ceremony 2.
Following each ceremony, bring your families and guests to the Great Hall in the Student Life Centre (SLC) for photos and refreshments.
In the first ceremony, the following degrees will awarded:
Thursday, June 14, 2018 — 1:30 PM to 4:00 PM EDT
The Faculty of Mathematics is exceptionally proud of our alumni for their outstanding accomplishments, innovation, and achievements within their research, communities, and professions.
Monday, June 4, 2018 — 4:00 PM EDT
Antonio Montalban, University of California - Berkeley
Infinite two-player games have been a very useful tool to prove many results in logic and other areas. What makes them fascinating to computability theorists is that winning strategies can be extremely complex even for simple games.
