Buridan's Principle - Speaker Deck

Slide 1

Slide 1 text

Buridan’s Principle Tom Santero Papers We Love Nov 19, 2015

Slide 2

Slide 2 text

“I’m interested in the intersection of philosophy and Computer Science” -- Michael R. Bernstein

Slide 3

Slide 3 text

Philosophy Science!!!

Slide 4

Slide 4 text

No content

Slide 5

Slide 5 text

The Paradox of Buridan’s Ass Part I

Slide 6

Slide 6 text

Ἀριστοτέλης 384 – 322 BC ...a man, being just as hungry as thirsty, and placed in between food and drink, must necessarily remain where he is and starve to death. -- On The Heavens

Slide 7

Slide 7 text

Jean Buridan 1295 – 1363 Should two courses be judged equal, then the will cannot break the deadlock; all it can do is suspend judgement until the circumstances change, and the right course of action is clear.

Slide 8

Slide 8 text

No content

Slide 9

Slide 9 text

No content

Slide 10

Slide 10 text

"Mr. Speaker, we have all heard of the animal standing in doubt between two stacks of hay, and starving to death. The like would never happen to General Cass; place the stacks a thousand miles apart, he would stand stock still midway between them, and eat them both at once, and the green grass along the line would be apt to suffer some too at the same time." -- insulting Democratic presidential candidate, Lewis Cass, in 1848 Abraham Lincoln 1809 – 1865

Slide 11

Slide 11 text

No content

Slide 12

Slide 12 text

Part II

Slide 13

Slide 13 text

Given: an Ass, two equal bails of hay Proposition: If placed equidistant between each bail of hay, there exists some finite starting positions for which an Ass could possibly starve to death.

Slide 14

Slide 14 text

1. Let x represent the starting position of our ass at time t = 0, such that x falls along the line joining two equal bails of hay at positions 0 and 1, where 0 < x < 1 [given] 2. Let A t (x) denotes the position of the ass at time t, as a function of time over x 3. t ≥ 0: A t (0) = 0; A t (1) = 1; {x ∈ ℝ | 0 < x < 1} [continuity] 4. Since A t (0) = 0 and A t (1) = 1 there must be a finite range of values of x for which 0 < A t (x) < 1 Q.E.D

Slide 15

Slide 15 text

x 0 1

Slide 16

Slide 16 text

Buridan’s Principle: A discrete decision based upon an input having a continuous range of values cannot be made within a bounded length of time.

Slide 17

Slide 17 text

Slide 18

Slide 18 text

Lamport’s Asses Part III

Slide 19

Slide 19 text

Choo Choooo! (hi Caitie, Kyle, Ryan and Jared)

Slide 20

Slide 20 text

No content

Slide 21

Slide 21 text

No content

Slide 22

Slide 22 text

Protip: pay attention to the direction of the arrows

Slide 23

Slide 23 text

No content

Slide 24

Slide 24 text

No content

Slide 25

Slide 25 text

You’re gonna get run over, you ass!

Slide 26

Slide 26 text

No content

Slide 27

Slide 27 text

No content

Slide 28

Slide 28 text

Continuity Part IV

Slide 29

Slide 29 text

Buridan’s Principle does not rely upon any assumption about how the decision is made; it rests only on the assumption of continuity.

Slide 30

Slide 30 text

A continuous mechanism must either forgo discreteness, permitting a continuous range of decisions, or must allow an unbounded length of time to make the decision.

Slide 31

Slide 31 text

Should we trust Lamport ?

Slide 32

Slide 32 text

Reasons to trust Lamport: - Manufacture d’horlogerie - taught us how to properly order pastries at a bakery - warned us about dangers of participating in Greek politics - the Art of War in Byzantium

Slide 33

Slide 33 text

No content

Slide 34

Slide 34 text

No content

Slide 35

Slide 35 text

It has been shown by Vosbury [14] and by Palais and Lamport [11] that the glitch phenomenon is inherent in arbiter circuits. These proofs are based on a continuous model of asynchronous circuits. In fact, Palais and Lamport state that a proof of this result must be based on a continuous model. We show otherwise; that is, we give a proof of the unavoidability of the glitch phenomenon that is based on a discrete circuit model.

Slide 36

Slide 36 text

No content

Slide 37

Slide 37 text

The impossibility of building a bounded-time arbiter seems to be a fundamental law of physics, not a mathematical theorem. For example, Anderson and Gouda [1] proved that a bounded-time arbiter cannot be constructed from certain kinds of components, but their proof offers no insight into why the quantum- mechanical arbiter described in [9] doesn’t work. We take the nonexistence of a bounded-time arbiter as an axiom.

Slide 38

Slide 38 text

No content

Slide 39

Slide 39 text

Buridan’s Law of Measurement: If x < y < z, then any measurement performed in a bounded length of time that has a nonzero probability of yielding a value in a neighborhood of x and a nonzero probability of yielding a value in a neighborhood of z must also have a nonzero probability of yielding a value in a neighborhood of y

Slide 40

Slide 40 text

Other Asses Part V

Slide 41

Slide 41 text

decisions may sometimes take longer than we expect

Slide 42

Slide 42 text

indecision considered harmful

Slide 43

Slide 43 text

there are certain circumstances where we cannot prolong choice

Slide 44

Slide 44 text

Entropy ain’t what it used to be Randomness can make it impossible deliberately to starve the ass

Slide 45

Slide 45 text

No content

Slide 46

Slide 46 text

asynchronous message passing as a continuous function of our initial state over time

Slide 47

Slide 47 text

Buridan’s Reliable Failure Detector: A process cannot make a discrete decision about the state of another process based upon an input having a continuous range of values within a bounded length of time.