Splash Biography
JORDAN HINES, ESP Teacher
Major: Physics College/Employer: UC Berkeley Year of Graduation: G 

Brief Biographical Sketch:
Not Available. Past Classes(Clicking a class title will bring you to the course's section of the corresponding course catalog)M1191: Counting Beyond Infinity in Splash Fall 2023 (Nov. 18, 2023)
What exactly is infinity? Is there something bigger than infinity? What is infinity plus one? In this class, we'll use mathematical games to explore the concept of infinity and define many different (inifinitely many, in fact!) infinite numbers.
M1073: SET and Friends in Splash Spring 2023 (Apr. 23, 2023)
SET is a popular card game of pattern recognition. Whether you're an expert at the game or have never played, come play SET and learn about some of the math behind it and some (mathinspired) variants! We'll touch fields of math such as group theory and combinatorics along the way.
S1106: Crash Course in Quantum Computing in Splash Spring 2023 (Apr. 23, 2023)
What is a qubit, and what makes it more exciting than a classical bit? What are topics that have been in the news such as quantum supremacy and quantum error correction really about?
In this class, I'll give an overview of what quantum computing is, what it isn't, and what progress is being made in quantum computing research.
M1028: Surreal Numbers and Games in Splash Fall 2022 (Oct. 29, 2022)
Learn how to play Hackenbush, a simple game that leads to interesting mathematics. After getting some practice playing, we'll see how the game inspires the surreal numbers, a system of numbers that allows us to to play with infinity in an unusual way.
M910: Surreal Numbers and Games in Splash Spring 2022 (Apr. 16  Oct. 29, 2022)
Learn how to play Hackenbush, a simple game that leads to interesting mathematics. After getting some practice playing, we'll see how the game inspires the surreal numbers, a system of numbers that allows us to to play with infinity in an unusual way.
M827: The Stable Matching Problem in Splash Fall 2021 (Oct. 30, 2021)
There are $$n$$ internships and $$n$$ possible interns. Each intern has a ranking of their preferred internships, and each internship has a ranking of their preferred interns, and our goal is to pair each intern with an internship.
Can all of the interns and internships be satisfied? It might be easy to see that not everyone can get their top choice in general, but what's the best we can do?
In this class, we'll discuss what it means for such a matching to be stable and discover an optimal algorithm for this problem, which is actually used to match medical students to residency programs!
M723: What is Quantum Supremacy? in Splash Spring 2021 (Mar. 13, 2021)
In 2019, Google made the news with a claim of achieving "quantum supremacy". What does this mean, and why do people care about quantum computing in the first place? In this class, I will give a highlevel overview of what makes quantum computing special, what quantum supremacy is, and what Google did. Along the way, we'll talk about some big ideas in quantum computing and theoretical computer science.
