Two Tricks
Abstract:
Trick 1. I have a deterministic function f that takes a 16-bit string as input and produces a number between 0 and 15 as output. The audience provides a string x and number y. We show that f(z) = y, where z is obtained from x by flipping just one bit.
Trick 2. A deck of cards is cut several times by the audience and the top 5 cards are removed. Those who have red cards stand up and the cards are determined.
We will talk about how f is designed and how the cards are determined.
Trick 1. I have a deterministic function f that takes a 16-bit string as input and produces a number between 0 and 15 as output. The audience provides a string x and number y. We show that f(z) = y, where z is obtained from x by flipping just one bit.
Trick 2. A deck of cards is cut several times by the audience and the top 5 cards are removed. Those who have red cards stand up and the cards are determined.
We will talk about how f is designed and how the cards are determined.
Speaker Bio
Prof. Neeldhara Misra is a Smt. Amba and Sri. V S Sastry Chair Associate Professor of Computer
Science and Engineering at the Indian Institute of Technology, Gandhinagar. She completed her PhD
from the Institute for Mathematical Sciences in 2012 in Theoretical Computer Science. Her research
interests include the design and analysis of algorithms and computational social choice. She is also
interested in visualizations and other methods to communicate computational thinking at an
elementary level. She also enjoys learning about new card tricks, especially self-working ones —
even though she can’t remember any!