More from Events Calendar
- Mar 64:00 PMEstimating Structural Models of Demand with Recentered InstrumentsPeter Hull (Brown University)
- Mar 64:00 PMOpen recreational swim for off campus familiesRecreational swims provide a fun and engaging way for children and parents to practice new skills, stay active, and enjoy quality time together in the pool with the MIT community.No Z Center (MIT Recreation - Zesiger Sports and Fitness Center) membership is required to participate.A parent or caregiver must accompany children in the water. Per Z Center policy, each adult may supervise up to two children at a time.Children must be at least 6 months old to join. If younger, they must be able to hold their head up comfortably. Registration is here. Only for MIT Spouses and Partners Connect members.
- Mar 64:00 PMTheory SeminarCoordination and Policy | Stephen Morris
- Mar 64:00 PMWriting about Numbers: Communicating Quantitative Information ClearlyWriting about numbers is an indispensable skill for communicators across the disciplines. Whether sharing your experimental results, supporting a stance or policy recommendation with quantitative evidence, or conveying financial information in a report, your job as a writer is to present this data clearly and effectively in straightforward pose.Sound like a communication tool you want to sharpen or add to your writer’s toolbox? Then why not join the MIT Writing and Communication Center (WCC) at its new workshop, “Writing about Numbers: Communicating Quantitative Information Clearly,” . Led by WCC Lecturer and communication specialist Chris Featherman, PhD, this interactive, hands-on workshop will help you do the following:Establish the context for quantitative dataDesign paragraphs for communicating numbersReport numbers in the text and relate them back to the main topicDescribe and summarize patterns in your quantitative dataPresent numbers without jargon to non-specialist audiences
- Mar 64:15 PMORC Spring 2025 Seminars
- Mar 64:30 PMApplied Math ColloquiumSpeaker: Dor Minzer (MIT)Title: On Approximability of Satisfiable CSPs and FriendsAbstract: Constraint satisfaction problems (CSPs in short) are among the most important computational problems studied in Theoretical Computer Science. This talk will focus on a recent line of study addressing the complexity of approximating satisfiable instances of CSPs, and connections of this study to multi-player parallel repetition theorems, property testing and combinatorics.Based mostly on joint works with Amey Bhangale, Subhash Khot and Yang P. Liu.