![Page 1: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/1.jpg)
““Belief Revision” Belief Revision” and and
Truth-FindingTruth-FindingKevin T. KellyKevin T. Kelly
Department of PhilosophyDepartment of Philosophy
Carnegie Mellon UniversityCarnegie Mellon [email protected]@andrew.cmu.edu
![Page 2: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/2.jpg)
Further ReadingFurther Reading
(with O. Schulte and V. Hendricks) (with O. Schulte and V. Hendricks) “Reliable Belief “Reliable Belief Revision”,Revision”, in in Logic and Scientific MethodsLogic and Scientific Methods, Dordrecht: , Dordrecht: Kluwer, 1997.Kluwer, 1997.
““The Learning Power of Iterated Belief Revision”,The Learning Power of Iterated Belief Revision”, in in Proceedings of the Seventh TARK ConferenceProceedings of the Seventh TARK Conference, 1998., 1998.
““Iterated Belief Revision, Reliability, and Inductive Iterated Belief Revision, Reliability, and Inductive Amnesia,”Amnesia,” ErkenntnisErkenntnis, 50: 1998, 50: 1998
![Page 3: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/3.jpg)
The IdeaThe Idea
• Belief revision theoryBelief revision theory... “... “rational” rational” belief changebelief change
• Learning theoryLearning theory..............................reliable reliable belief changebelief change
• Conflict?Conflict?Truth
![Page 4: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/4.jpg)
Part IPart I
Iterated Belief RevisionIterated Belief Revision
![Page 5: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/5.jpg)
Bayesian (Vanilla) UpdatingBayesian (Vanilla) Updating
B
Propositional epistemic state
![Page 6: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/6.jpg)
Bayesian (Vanilla) UpdatingBayesian (Vanilla) Updating
B
E newevidence
• New belief is intersectionNew belief is intersection• Perfect memoryPerfect memory• No inductive leapsNo inductive leaps
![Page 7: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/7.jpg)
Bayesian (Vanilla) UpdatingBayesian (Vanilla) Updating
BB’
E
• New belief is intersectionNew belief is intersection• Perfect memoryPerfect memory• No inductive leapsNo inductive leaps
![Page 8: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/8.jpg)
Bayesian (Vanilla) UpdatingBayesian (Vanilla) Updating
• New belief is intersectionNew belief is intersection• Perfect memoryPerfect memory• No inductive leapsNo inductive leaps
BB’
E
![Page 9: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/9.jpg)
““Epistemic Hell” (a.k.a. Nirvana)Epistemic Hell” (a.k.a. Nirvana)
B
![Page 10: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/10.jpg)
““Epistemic Hell” (a.k.a. Nirvana)Epistemic Hell” (a.k.a. Nirvana)
B
E Surprise!
![Page 11: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/11.jpg)
Epistemic Hell (a.k.a. Nirvana)Epistemic Hell (a.k.a. Nirvana)
• Scientific revolutionsScientific revolutions• Suppositional reasoningSuppositional reasoning• Conditional pragmaticsConditional pragmatics• Decision theoryDecision theory• Game theoryGame theory• Data basesData bases
B
E
Epistemic hell
![Page 12: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/12.jpg)
Ordinal Epistemic StatesOrdinal Epistemic StatesSpohn 88Spohn 88
• Ordinal-valued degrees of “implausibility”Ordinal-valued degrees of “implausibility”• Belief state is bottom levelBelief state is bottom level
S
b (S)
2
1
0
+ 1
![Page 13: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/13.jpg)
Iterated Belief RevisionIterated Belief Revision
*
S0
E0 E1
input propositionsE2
epistemic state trajectory
initial state
![Page 14: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/14.jpg)
Iterated Belief RevisionIterated Belief Revision
S1
*
S0
E1 E2
input propositions
epistemic state trajectory
![Page 15: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/15.jpg)
Iterated Belief RevisionIterated Belief Revision
S1
*
S0
E1 E2
input propositions
epistemic state trajectory
![Page 16: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/16.jpg)
Iterated Belief RevisionIterated Belief Revision
*
S1S0
E2
input proposition
S2
epistemic state trajectory
![Page 17: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/17.jpg)
Iterated Belief RevisionIterated Belief Revision
*
S1S0
E2
input proposition
S2
epistemic state trajectory
![Page 18: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/18.jpg)
Iterated Belief RevisionIterated Belief Revision
*
epistemic state trajectory
S1S0 S2 S3
![Page 19: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/19.jpg)
Iterated Belief RevisionIterated Belief Revision
*
epistemic state trajectory
S1S0 S2 S3
b (S0) b (S1) b (S2) b (S3)
belief state trajectory
![Page 20: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/20.jpg)
Generalized Conditioning *Generalized Conditioning *CCSpohn 88Spohn 88
S
![Page 21: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/21.jpg)
Generalized Conditioning *Generalized Conditioning *CCSpohn 88Spohn 88
E
S
E
• Condition entire epistemic stateCondition entire epistemic state
![Page 22: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/22.jpg)
Generalized Conditioning *Generalized Conditioning *CCSpohn 88Spohn 88
• Condition entire epistemic stateCondition entire epistemic state
E
B’
S
E
S *C E
*C
![Page 23: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/23.jpg)
Lexicographic Updating *Lexicographic Updating *LLSpohn 88, Nayak 94Spohn 88, Nayak 94
S
![Page 24: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/24.jpg)
Lexicographic Updating *Lexicographic Updating *LLSpohn 88, Nayak 94Spohn 88, Nayak 94
S
E
• Lift refuted possibilities above Lift refuted possibilities above non-refuted possibilities non-refuted possibilities preserving order.preserving order.
![Page 25: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/25.jpg)
Lexicographic Updating *Lexicographic Updating *LLSpohn 88, Nayak 94Spohn 88, Nayak 94
• Lift refuted possibilities above Lift refuted possibilities above non-refuted possibilities non-refuted possibilities preserving order.preserving order.
B’
S S *L E
E
*L
![Page 26: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/26.jpg)
Minimal or “Natural” Updating *Minimal or “Natural” Updating *MMSpohn 88, Boutilier 93Spohn 88, Boutilier 93
S
![Page 27: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/27.jpg)
Minimal or “Natural” Updating *Minimal or “Natural” Updating *MMSpohn 88, Boutilier 93Spohn 88, Boutilier 93
E
S
• Drop the lowest Drop the lowest possibilities consistent possibilities consistent with the data to the bottom with the data to the bottom and raise everything else and raise everything else up one notchup one notch
![Page 28: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/28.jpg)
Minimal or “Natural” Updating *Minimal or “Natural” Updating *MMSpohn 88, Boutilier 93Spohn 88, Boutilier 93
• Drop the lowest Drop the lowest possibilities consistent possibilities consistent with the data to the bottom with the data to the bottom and raise everything else and raise everything else up one notchup one notch E
S S *M E
*M
![Page 29: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/29.jpg)
The Flush-to-The Flush-to- Method * Method *F,F,Goldszmidt and Pearl 94Goldszmidt and Pearl 94
S
![Page 30: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/30.jpg)
The Flush-to-The Flush-to- Method * Method *F,F,Goldszmidt and Pearl 94Goldszmidt and Pearl 94
E
S
EE
S
“boost parameter” • Send non-Send non-EE worlds to worlds to
and drop and drop E E -worlds rigidly -worlds rigidly to the bottomto the bottom
![Page 31: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/31.jpg)
The Flush-to-The Flush-to- Method * Method *F,F,Goldszmidt and Pearl 94Goldszmidt and Pearl 94
• Send non-Send non-EE worlds to worlds to and drop and drop E E -worlds rigidly -worlds rigidly to the bottomto the bottom
E
S S *F, E
EE
*F,
S
![Page 32: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/32.jpg)
Ordinal Jeffrey Conditioning *Ordinal Jeffrey Conditioning *J,J,Spohn 88 Spohn 88
S
![Page 33: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/33.jpg)
Ordinal Jeffrey Conditioning *Ordinal Jeffrey Conditioning *J,J,Spohn 88 Spohn 88
E
S
EE
![Page 34: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/34.jpg)
Ordinal Jeffrey Conditioning *Ordinal Jeffrey Conditioning *J,J,Spohn 88 Spohn 88
E
S
EE
• Drop Drop E E worlds to the worlds to the bottom. Drop non-bottom. Drop non-EE worlds worlds to the bottom and then jack to the bottom and then jack them up to level them up to level
![Page 35: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/35.jpg)
Ordinal Jeffrey Conditioning *Ordinal Jeffrey Conditioning *J,J,Spohn 88 Spohn 88
• Drop Drop E E worlds to the worlds to the bottom. Drop non-bottom. Drop non-EE worlds worlds to the bottom and then jack to the bottom and then jack them up to level them up to level
E
S S *J, E
EE
*J,
![Page 36: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/36.jpg)
Empirical BackslidingEmpirical Backsliding
• Ordinal Jeffrey Ordinal Jeffrey conditioning can conditioning can increase the increase the plausibility of a plausibility of a refuted possibilityrefuted possibility
E
![Page 37: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/37.jpg)
The Ratchet Method *The Ratchet Method *R,R,Darwiche and Pearl 97Darwiche and Pearl 97
S
![Page 38: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/38.jpg)
The Ratchet Method *The Ratchet Method *R,R,Darwiche and Pearl 97Darwiche and Pearl 97
S
E
• Like ordinal Jeffrey Like ordinal Jeffrey conditioning except conditioning except refuted possibilities move refuted possibilities move up by up by from their current from their current positionspositions
![Page 39: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/39.jpg)
The Ratchet Method *The Ratchet Method *R,R,Darwiche and Pearl 97Darwiche and Pearl 97
• Like ordinal Jeffrey Like ordinal Jeffrey conditioning except conditioning except refuted possibilities move refuted possibilities move up by up by from their current from their current positionspositions
S
S *R, E
E
B
B’
*R,
![Page 40: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/40.jpg)
Part IIPart II
Properties of the MethodsProperties of the Methods
![Page 41: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/41.jpg)
Timidity and StubbornnessTimidity and Stubbornness
• TimidityTimidity: : no inductive leaps no inductive leaps without refutationwithout refutation..
• Stubbornness:Stubbornness: no retractions no retractions without refutationwithout refutation
• Examples:Examples: all the aboveall the above
• Nutty!Nutty!BB’
![Page 42: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/42.jpg)
Timidity and StubbornnessTimidity and Stubbornness
BB’
• Timidity:Timidity: no inductive leaps no inductive leaps without refutation.without refutation.
• Stubbornness:Stubbornness: no retractions no retractions without refutationwithout refutation
• Examples:Examples: all the aboveall the above
• Nutty!Nutty!
![Page 43: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/43.jpg)
Timidity and StubbornnessTimidity and Stubbornness
BB’
• TimidityTimidity: : no inductive leaps no inductive leaps without refutation.without refutation.
• Stubbornness:Stubbornness: no retractions no retractions without refutationwithout refutation
• Examples:Examples: all the aboveall the above
• Nutty!Nutty!
![Page 44: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/44.jpg)
Local ConsistencyLocal Consistency
• Local consistency:Local consistency: new new belief must be consistent belief must be consistent with the current consistent with the current consistent datumdatum
• Examples:Examples: all the aboveall the above
![Page 45: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/45.jpg)
Positive Order-invariancePositive Order-invariance
• Positive order-invariance:Positive order-invariance: preserve original ranking preserve original ranking inside conjunction of datainside conjunction of data
• Examples: Examples: • **CC, *, *LL, *, *R, R, , *, *J, J, ..
![Page 46: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/46.jpg)
Data-PrecedenceData-Precedence
• Data-precedence:Data-precedence: Each world Each world satisfying all the data is placed satisfying all the data is placed above each world failing to above each world failing to satisfy some datum.satisfy some datum.
• Examples:Examples:
• **CC, *, *LL
• **R, R, , *, *J, J, , if , if is above is above S S . .
S
![Page 47: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/47.jpg)
Enumerate and TestEnumerate and Test
Enumerate-and-test:Enumerate-and-test:– locally consistent,locally consistent,
– positively invariantpositively invariant
– data-precedentdata-precedent Examples:Examples:
– **CC, *, *LL
– **R, R, , *, *J, J, , if , if is above is above S S ..
preserved implausibilitystructure
epistemicdump forrefutedpossibilities
![Page 48: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/48.jpg)
Part IIIPart III
Belief Revision as LearningBelief Revision as Learning
![Page 49: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/49.jpg)
A Very Simple Learning ParadigmA Very Simple Learning Paradigm
mysterious system
datatrajectory
![Page 50: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/50.jpg)
A Very Simple Learning ParadigmA Very Simple Learning Paradigm
mysterious system
datatrajectory
![Page 51: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/51.jpg)
A Very Simple Learning ParadigmA Very Simple Learning Paradigm
mysterious system
datatrajectory
![Page 52: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/52.jpg)
A Very Simple Learning ParadigmA Very Simple Learning Paradigm
mysterious system
datatrajectory
![Page 53: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/53.jpg)
Possible Outcome TrajectoriesPossible Outcome Trajectories
e|n
possible data trajectories
e
![Page 54: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/54.jpg)
Finding the TruthFinding the Truth
((*, S*, S00) ) identifiesidentifies ee
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)])) = {)])) = {ee}}
![Page 55: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/55.jpg)
Finding the TruthFinding the Truth
((*, S*, S00) ) identifies identifies ee
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)]) = {)]) = {ee}}
truth
![Page 56: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/56.jpg)
Finding the TruthFinding the Truth
((*, S*, S00)) identifies identifies e e
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)]) = {)]) = {ee}}
truth
![Page 57: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/57.jpg)
Finding the TruthFinding the Truth
((*, S*, S00)) identifies identifies e e
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)]) = {)]) = {ee}}
truth
![Page 58: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/58.jpg)
Finding the TruthFinding the Truth
((*, S*, S00) ) identifiesidentifies e e
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)]) = {)]) = {ee}}
truth
![Page 59: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/59.jpg)
Finding the TruthFinding the Truth
((*, S*, S00) ) identifiesidentifies e e
for all but finitely many for all but finitely many nn, ,
bb((SS00 * ([0, * ([0, ee(0)], ... , [(0)], ... , [nn, , ee((nn)]) = {)]) = {ee}}
completely true belief
![Page 60: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/60.jpg)
Reliability is No AccidentReliability is No Accident
• Let Let K K be a range of possible outcome trajectoriesbe a range of possible outcome trajectories• ((*, S*, S00) ) identifies Kidentifies K ((*, S*, S00) identifies each ) identifies each ee in in K.K.
• Fact:Fact: K K is identifiable is identifiable K K is countableis countable..
![Page 61: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/61.jpg)
CompletenessCompleteness
• * is * is completecomplete • for each identifiable for each identifiable KK • there is an there is an SS00 such that, such that,
• KK is identifiable by ( is identifiable by (*, S*, S00).).
• Else * is Else * is restrictiverestrictive. .
![Page 62: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/62.jpg)
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 63: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/63.jpg)
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
•Enumerate K •Choose arbitrary e in K
e
CompletenessCompleteness
![Page 64: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/64.jpg)
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 65: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/65.jpg)
data precedence
positive invariance
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 66: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/66.jpg)
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 67: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/67.jpg)
data precedence
positive invariance
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 68: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/68.jpg)
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 69: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/69.jpg)
data precedence
local consistency
convergence
Proposition:Proposition: If * enumerates and tests, * is complete.If * enumerates and tests, * is complete.
CompletenessCompleteness
![Page 70: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/70.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 71: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/71.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 72: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/72.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 73: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/73.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 74: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/74.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 75: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/75.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 76: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/76.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
![Page 77: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/77.jpg)
AmnesiaAmnesia
Without data precedence, memory can failWithout data precedence, memory can fail
Same example, using *Same example, using *J,1J,1. .
E
E is forgotten
![Page 78: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/78.jpg)
DualityDuality
. . .
remembersdoesn’t predict
predictsmay forget
conjectures and refutations
tabula rasa
![Page 79: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/79.jpg)
““Rationally” Imposed TensionRationally” Imposed Tension
compression for memory
rarefaction for inductive leaps
Can both beaccommodated?
![Page 80: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/80.jpg)
Inductive AmnesiaInductive Amnesia
compression for memory
rarefaction for inductive leaps
Restrictiveness:No possible initialstate resolves the pressure
Bang!
![Page 81: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/81.jpg)
QuestionQuestion
• Which methods are Which methods are guiltyguilty??• Are some Are some worseworse than others? than others?
![Page 82: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/82.jpg)
Part IV:Part IV:
The Goodman HierarchyThe Goodman Hierarchy
![Page 83: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/83.jpg)
The Grue OperationThe Grue OperationNelson GoodmanNelson Goodman
nnee
ee ‡ ‡ nn
![Page 84: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/84.jpg)
Grue Complexity HierarchyGrue Complexity Hierarchy
GG00((ee))GG11((ee))
GG22((ee))GG33((ee))
GG00eveneven((ee))
GG11eveneven
((ee))
GG((ee)) GGeveneven
((ee))finite variants of e finite variants of e ,¬e
GG44((ee)) GG22eveneven
((ee))
![Page 85: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/85.jpg)
Classification: even gruesClassification: even grues
GG00eveneven
((ee))GG11
eveneven ((ee))
GG22eveneven
((ee))
GGnneveneven
((ee))
GGeveneven
((ee))
= 1
Min Flush Jeffrey Ratch Lex Cond
= 0
= 2
= 3
= n +1
= 0 = 0
= 1
= 1
= 1
= 1
yes
yes
yes
yes
yes yes
yes
yes
yes
yes
= 1
= 1
yes
no
no
no
no =
= 1
![Page 86: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/86.jpg)
Classification: even gruesClassification: even grues
GG00eveneven
((ee))GG11
eveneven ((ee))
GG22eveneven
((ee))
GGnneveneven
((ee))
GGeveneven
((ee))
= 1
Min Flush Jeffrey Ratch Lex Cond
= 0
= 2
= 3
= n +1
= 0 = 0
= 1
= 1
= 1
= 1
yes
yes
yes
yes
yes yes
yes
yes
yes
yes
= 1
= 1
yes
no
no
no
no =
= 1
![Page 87: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/87.jpg)
Hamming AlgebraHamming Algebra
aa HH b mod e b mod e
aa differs from differs from ee only where only where bb does. does.
1 1 1
1 1 0 1 0 1 0 1 1
1 0 0 0 1 0 0 0 1
0 0 0
Hamming
![Page 88: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/88.jpg)
**R,1 R,1 ,*,*J,1 J,1 can identify can identify GGeveneven((ee))
a
e
a e Example
Learning as rigidhypercube rotation
![Page 89: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/89.jpg)
**R,1 R,1 ,*,*J,1 J,1 can identify can identify GGeveneven((ee))
a
e
Learning as rigidhypercube rotation
![Page 90: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/90.jpg)
**R,1 R,1 ,*,*J,1 J,1 can identify can identify GGeveneven((ee))
a
e Learning as rigidhypercube rotation
![Page 91: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/91.jpg)
**R,1 R,1 ,*,*J,1 J,1 can identify can identify GGeveneven((ee))
a
e Learning as rigidhypercube rotation
convergence
![Page 92: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/92.jpg)
Classification: even gruesClassification: even grues
GG00eveneven
((ee))GG11
eveneven ((ee))
GG22eveneven
((ee))
GGnneveneven
((ee))
GGeveneven
((ee))
= 1
Min Flush Jeffrey Ratch Lex Cond
= 0
= 2
= 3
= n +1
= 0 = 0
= 1
= 1
= 1
= 1
yes
yes
yes
yes
yes yes
yes
yes
yes
yes
= 1
= 1
yes
no
no
no
no =
= 1
![Page 93: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/93.jpg)
Classification: arbitrary gruesClassification: arbitrary grues
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
= 2
= 2
= 2 yes
yes
yes
yes yes
yes
yes
yes
= 2
= 2
no
no
no
no = = 2
= n +1
= 3
= 2
yes = 2 yes
= 0 = 0 = 0yes
= 1
![Page 94: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/94.jpg)
Classification: arbitrary gruesClassification: arbitrary grues
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
= 2
= 2
= 2
yes
yes
yes
yes yes
yes
yes = 2
yes = 2
no
no
no
no = = 2 = 2
= n +1
= 3
= 2
yes yes
= 0 = 0 = 0yes
= 1
![Page 95: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/95.jpg)
**R,2R,2 is Complete is Complete
Impose the Hamming distance ranking on each Impose the Hamming distance ranking on each finite variant classfinite variant class
Now raise the Now raise the nnth Hamming ranking by th Hamming ranking by nn
CC00 CC11 CC22 CC33 CC44
SS
![Page 96: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/96.jpg)
**R,2R,2 is Complete is Complete
Data streams in the same column just barely make Data streams in the same column just barely make it because they jump by 2 for each difference from it because they jump by 2 for each difference from the truththe truth
CC00 CC11 CC22 CC33 CC44
SS2 differences from truth
1 difference from truth
![Page 97: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/97.jpg)
Classification: arbitrary gruesClassification: arbitrary grues
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
= 2
= 2
= 2
yes
yes
yes
yes yes
yes
yes = 2
yes = 2
no
no
no
no = = 2 = 2
= n +1
= 3
= 2
yes yes
= 0 = 0 = 0yes
= 1
Can’t use Hammingrank
![Page 98: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/98.jpg)
Wrench In the WorksWrench In the Works
Suppose *Suppose *J,2 J,2 succeeds with Hamming rank.succeeds with Hamming rank.
Feed ¬ Feed ¬ e e until it is uniquely at the bottom. until it is uniquely at the bottom.
¬e
k
By convergent success
![Page 99: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/99.jpg)
So for some later So for some later nn,,
Wrench In the WorksWrench In the Works
Still alone since timid and stubborn
a
¬e
b
k n
If empty, things go even worse!
Hamming rank and positive invariance.
![Page 100: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/100.jpg)
bb moves up at most 1 step since ¬ moves up at most 1 step since ¬ee is still alone is still alone (rule)(rule)
Wrench In the WorksWrench In the Works
a
¬e
b
k n
Refuted worlds touch bottom and getlifted by at most two.
![Page 101: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/101.jpg)
So So bb never rises above never rises above aa when when aa is true is true (positive invariance)(positive invariance) Now Now aa and and bb agree forever, so can never be separated. agree forever, so can never be separated. So never converges in So never converges in aa or forgets refutation of or forgets refutation of bb..
Wrench In the WorksWrench In the Works
a
¬e
b
k n
a
![Page 102: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/102.jpg)
Hamming vs. Goodman AlgebrasHamming vs. Goodman Algebras
aa HH b mod e b mod e a a differs from differs from e e only where only where b does.b does.
aa GG b mod e b mod e a a grues grues e e only where only where b does.b does.
Goodman1 0 1
1 1 0 0 1 0
0 1 1 0 0 1
0 0 0
1 1 1
1 1 0 1 0 1 0 1 1
1 0 0 0 1 0 0 0 1
0 0 0
Hamming
1 0 0
1 1 1
![Page 103: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/103.jpg)
Epistemic States as Boolean RanksEpistemic States as Boolean Ranks
GoodmanHamming
GG((ee))GGeveneven
((ee))
GGoddodd
((ee))
e e
![Page 104: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/104.jpg)
**J,2 J,2 can identify can identify GG ((ee))
Proof: Proof: Use the Goodman ranking as initial stateUse the Goodman ranking as initial state Then *Then *J,2 J,2 always believes that the observed grues always believes that the observed grues
are the only ones that will ever occur.are the only ones that will ever occur.
Note: Note: OckhamOckham with respect to reversal counting with respect to reversal counting problem.problem.
![Page 105: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/105.jpg)
Classification: arbitrary gruesClassification: arbitrary grues
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
= 2
= 2
= 2
yes
yes
yes
yes yes
yes
yes = 2
yes = 2
no
no
no
no = = 2 = 2
= n +1
= 3
= 2
yes yes
= 0 = 0 = 0yes
= 1
![Page 106: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/106.jpg)
Methods *Methods *J,1J,1; *; *MM Fail on Fail on GG11((ee))
Proof: Proof: Suppose otherwiseSuppose otherwise Feed Feed ee until until ee is uniquely at the bottom is uniquely at the bottom
e
data so far
![Page 107: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/107.jpg)
Methods *Methods *J,1J,1; *; *MM Fail on Fail on GG11((ee))
By the well-ordering condition, By the well-ordering condition,
e
data so far
...else infinitedescending chain
![Page 108: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/108.jpg)
Methods *Methods *J,1J,1; *; *MM Fail on Fail on GG11((ee))
Now feed Now feed e’ e’ foreverforever By stage By stage n, n, the picture is the samethe picture is the same
e
e’
e’’
e’ n
positive order invariance
timidity and stubbornness
![Page 109: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/109.jpg)
Methods *Methods *J,1J,1; *; *MM Fail on Fail on GG11((ee))
At stage At stage nn +1, +1, e e stays at the stays at the bottom bottom (timid and stubborn)(timid and stubborn)..
So So e’ e’ can’t travel down can’t travel down (rule)(rule)
e’’ e’’ doesn’t rise doesn’t rise (rule)(rule)
Now Now e’’ e’’ makes it to the bottom makes it to the bottom at least as soon as at least as soon as e’e’
e
e’
e’’
e’ n
![Page 110: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/110.jpg)
Classification: arbitrary gruesClassification: arbitrary grues
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
= 2
= 2
= 2 yes
yes
yes
yes yes
yes
yes
yes
= 2
= 2
no
no
no
no = = 2 = 2
= n +1
= 3
= 2
yes yes
= 0 = 0 = 0yes
= 1
forcedbacksliding
![Page 111: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/111.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
ProofProof: Suppose otherwise: Suppose otherwise Bring Bring ee uniquely to the bottom, say at stage uniquely to the bottom, say at stage kk
e
k
![Page 112: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/112.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Start feeding Start feeding a a = = ee ‡ ‡ kk
e
k
a
![Page 113: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/113.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
By some stage By some stage k’k’, , a a is uniquely downis uniquely down So between So between k + k + 1 and 1 and k’k’, there is a first stage , there is a first stage j j when no finite variant of when no finite variant of ee is at is at
the bottomthe bottom
e
k k’
a
![Page 114: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/114.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Let Let c c in in GG22((e e ) be a finite variant of ) be a finite variant of e e that rises to level 1 at that rises to level 1 at jj
k’
a
k j
c
![Page 115: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/115.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
k’
a
k j
c
Let Let c c in in GG22((e e ) be a finite variant of ) be a finite variant of e e that rises to level 1 at that rises to level 1 at jj
![Page 116: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/116.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
SoSo c c((j j - 1) is not - 1) is not aa((j j - 1)- 1)k’
a
k j
c
![Page 117: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/117.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Let Let dd be be aa up to up to jj and and ee thereafterthereafter
So is in So is in GG22((ee)) Since Since dd differs from differs from ee, , dd is at is at
least as high as level 1 at least as high as level 1 at j j k’
a
k j
c
d
1
![Page 118: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/118.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Show: Show: cc agrees with agrees with ee after after jj..
k’
a
k j
c
d
1
![Page 119: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/119.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Case: Case: jj = = kk+1+1 Then Then cc could have been chosen could have been chosen
as as ee since since ee is uniquely at the is uniquely at the bottom at bottom at kkk’
a
k j
c
d
1
![Page 120: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/120.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Case: Case: jj > > kk+1+1 Then Then cc wouldn’t have been at wouldn’t have been at
the bottom if it hadn’t agreed the bottom if it hadn’t agreed with with aa (disagreed with (disagreed with ee))k’
a
k j
c
d
1
![Page 121: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/121.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Case: Case: jj > > kk+1+1 So So cc has already used up its two has already used up its two
grues against grues against ee
k’
a
k j
c
d
1
![Page 122: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/122.jpg)
Method *Method *R,1R,1 Fails on Fails on GG22((ee))with Oliver Schultewith Oliver Schulte
Feed c forever afterFeed c forever after By positive invariance, either By positive invariance, either
never projects never projects or or forgetsforgets the the refutation of refutation of cc at at jj-1 -1 k’ k j
c
d
1
d
![Page 123: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/123.jpg)
Without Well-OrderingWithout Well-Ordering
GG00((ee))GG11((ee))
GG22((ee))
GG33((ee))
GG((ee))
Min Flush Jeffrey Ratch Lex Cond
yes
yes
yes
yes yes
yes
yes
yes
yes
no
no
no yes yes
yes
infinite descendingchains can help!
![Page 124: “Belief Revision” and Truth-Finding Kevin T. Kelly Department of Philosophy Carnegie Mellon University kk3n@andrew.cmu.edu](https://reader035.vdocuments.site/reader035/viewer/2022062320/56649d2a5503460f949ff437/html5/thumbnails/124.jpg)
SummarySummary
• Belief revision Belief revision constrainsconstrains possible inductive strategies possible inductive strategies• ““No induction without contradiction” (?!!)No induction without contradiction” (?!!)• ““Rationality” Rationality” weakensweakens learning power of learning power of idealideal agents. agents.• PredictionPrediction vs.vs. memorymemory• Precise recommendations for rationalistsPrecise recommendations for rationalists::
• boosting by 2 boosting by 2 vsvs. 1. 1
• backslide backslide vsvs. ratchet. ratchet
• well-orderingwell-ordering
• Hamming vs. Goodman rankHamming vs. Goodman rank