Three Puzzles on Mathematics, Computation, and Games
Gil Kalai
TL;DR
This paper discusses three mathematical puzzles related to the effectiveness of the simplex algorithm, election vote counting errors, and the feasibility of quantum computers, highlighting ongoing challenges in mathematics and computation.
Contribution
It presents three open puzzles that connect mathematics, computation, and real-world applications, emphasizing unresolved questions in these areas.
Findings
The simplex algorithm's success remains not fully understood.
Vote counting errors can significantly impact election outcomes.
The possibility of practical quantum computers is still uncertain.
Abstract
In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear programming. The second puzzle is about errors made when votes are counted during elections. The third puzzle is: are quantum computers possible?
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTeaching and Learning Programming · Graph Labeling and Dimension Problems