Latkes vs' Hamantaschen - PowerPoint PPT Presentation

About This Presentation
Title:

Latkes vs' Hamantaschen

Description:

What is the information content. of each food? (measured in bytes) Informational Complexity ... NP ('Nosh Chanukah') ('Nosh Purim' ... – PowerPoint PPT presentation

Number of Views:30
Avg rating:3.0/5.0
Slides: 19
Provided by: clsp
Learn more at: https://www.cs.jhu.edu
Category:

less

Transcript and Presenter's Notes

Title: Latkes vs' Hamantaschen


1
Latkes vs. Hamantaschen
  • Prof. Jason Eisner
  • Department of Computer Science
  • JHU Debate Dec. 4, 2007

2
Simplicity vs. Complexity
3
Simplicity vs. Complexity
4
Simplicity vs. Complexity
  • Establishing hamantaschic superiority
  • Informational complexity
  • Linguistic complexity
  • Computational complexity

5
Informational Complexity
  • What is the information content of each food?

6
Informational Complexity
  • Asymmetries
  • Alas, orientation is not reliably transmitted

7
Fine-grained Informational Complexity
  • n strands of potato
  • 4 real s per strand
  • k bits recovered per real
  • 4kn bits?

8
Fine-grained Informational Complexity
(0,0,1,0)
(0,0,0,1)
(0,1,0,0)
(each points coords sum to 1)
(1,0,0,0)
  • n poppy seeds
  • 3 real s per seed
  • k bits recovered per real

9
Fine-grained Informational Complexity
(0,0,1,0)
(0,0,0,1)
(0,1,0,0)
(each points coords sum to 1)
(1,0,0,0)
  • n poppy seeds
  • 3 real s per seed
  • k bits recovered per real
  • n potato strands
  • 4 real s per strand
  • k bits recovered per real

?
10
Fine-grained Informational Complexity
(0,0,1,0)
(0,0,0,1)
(0,1,0,0)
(each points coords sum to 1)
(1,0,0,0)
  • n poppy seeds
  • 3 real s per seed
  • k bits recovered per real
  • n potato strands
  • 4 real s per strand
  • k bits recovered per real

?
11
Linguistic Complexity
  • Gemetria
  • The Bible Code

10
22
50-point length bonus!
12
Point of Order
13
Purim, a.k.a. the Feast of Lots
14
Purim, a.k.a. the Feast of Lots
15
Computational Complexity
? NC
? NP
?
(Nosh Chanukah)
(Nosh Purim)
decidable in polylogarithmic time with a
polynomial number of processors
decidable in polynomial time with a
nondeterministic processor
16
Computational Complexity
? NC
? NP
?
(Nosh Chanukah)
(Nosh Purim)
  • NP is more computationally complex!
  • But dont want to prove that is NP-hard

17
Computational Complexity
  • So lets do a direct reduction
  • This is a poppynomial reduction
  • Implies existence of a gastric reduction
  • Therefore, if you can digest a hamantasch, you
    can digest a latke
  • Therefore, the hamantasch is the more complex
    carbohydrate

18
Conclusions
  • Judaism loves complexity
  • Hamantaschen are more complex
  • Informational complexity
  • Linguistic complexity
  • Computational complexity
  • And theyll enhance your math!
Write a Comment
User Comments (0)
About PowerShow.com