Debate on Latkes vs. Hamantaschen: Analyzing Complexity in Jewish Foods
Delve into the debate between Latkes and Hamantaschen led by Prof. Jason Eisner from JHU's Department of Computer Science. Explore the juxtaposition of Jewish simplicity and complexity through the lenses of informational, linguistic, and computational intricacies. Unravel the informational content of each food item, examine asymmetries, and navigate fine-grained informational complexities in a stimulating intellectual discourse.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Latkes vs. Hamantaschen Prof. Jason Eisner Department of Computer Science JHU Debate Dec. 4, 2024
Jewish Simplicity vs. Complexity
Jewish Simplicity vs. Complexity
Jewish Simplicity vs. Complexity Establishing hamantaschic superiority: 1. Informational complexity 2. Linguistic complexity 3. Computational complexity
Informational Complexity What is the information content of each food? (measured in bytes)
Informational Complexity Asymmetries heads tails Alas, orientation is not reliably transmitted
Fine-grained Informational Complexity (x1,y1) (x2,y2) n strands of potato * 4 real #s per strand * k bits recovered per real = 4kn bits? Strands are unordered: 4 1 k 2 log 4 log kn n n 2 2 n
Fine-grained Informational Complexity (0,0,1,0) (0,1,0,0) (each point s coords sum to 1) (1,0,0,0) n poppy seeds * 3 real #s per seed * k bits recovered per real 2 log 3 k kn 3 log n n 2 2 n
Fine-grained Informational Complexity (0,0,1,0) (0,1,0,0) (x1,y1) (each point s coords sum to 1) (x2,y2) (1,0,0,0) n potato strands * 4 real #s per strand * k bits recovered per real 2 log n poppy seeds * 3 real #s per seed * k bits recovered per real 2 log 4 1 3 k k 4 log kn 3 log kn n n n n 2 2 2 2 n n
Fine-grained Informational Complexity (0,0,1,0) (0,1,0,0) (x1,y1) (each point s coords sum to 1) (x2,y2) (1,0,0,0) n potato strands * 4 real #s per strand * k bits recovered per real n n poppy seeds * 3 real #s per seed * k bits recovered per real 2 log 4 1 3 k k 2 log 4 log kn 3 log kn n n n n 2 2 2 2 n
Linguistic Complexity Gemetria The Bible Code = 10 = 22 + 50-point length bonus!
Point of Order This debate Chanukah 2024-2025 Purim
Computational Complexity NC ( Nosh Chanukah ) NP ( Nosh Purim ) decidable in polylogarithmic time with a polynomial number of processors decidable in polynomial time with a nondeterministic processor
Computational Complexity NC ( Nosh Chanukah ) NP ( Nosh Purim ) NP is more computationally complex! But don t want to prove that is NP-hard
Computational Complexity So let s do a direct reduction: This is a poppynomial reduction Implies existence of a gastric reduction If you can digest a hamantasch, you can digest a latke Therefore, the hamantasch is the more complex carbohydrate
Conclusions Judaism loves complexity Hamantaschen are more complex 1. Informational complexity 2. Linguistic complexity 3. Computational complexity And they ll enhance your math!
