Cellular-Automata-Generalized-to-an-Inferential-System:元胞自動機廣義推理系統(tǒng)-課件_第1頁
Cellular-Automata-Generalized-to-an-Inferential-System:元胞自動機廣義推理系統(tǒng)-課件_第2頁
Cellular-Automata-Generalized-to-an-Inferential-System:元胞自動機廣義推理系統(tǒng)-課件_第3頁
Cellular-Automata-Generalized-to-an-Inferential-System:元胞自動機廣義推理系統(tǒng)-課件_第4頁
Cellular-Automata-Generalized-to-an-Inferential-System:元胞自動機廣義推理系統(tǒng)-課件_第5頁
已閱讀5頁,還剩62頁未讀, 繼續(xù)免費閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進行舉報或認領(lǐng)

文檔簡介

CellularAutomataGeneralizedToAnInferentialSystemDavidJ.BlowerCogonSystemsPensacolaFL27thInternationalWorkshoponBayesianInferenceandMaximumEntropyMethodsinScienceandEngineering,SaratogaSprings,NewYork,11July2019MotivationWhyisitimpossibletopredictthebehaviourofacellularautomaton?TheMotivatingQuestionButisn’tthequintessentialfeatureofprobabilitytheoryandinferentialsystemstheabilitytopredictfutureevents?ProposedSolutionJaynesusedprobabilitytheorytogeneralizeclassicallogicfunctions.TreatCAfromaninferentialandinformationalpointofview.WhyExamineCellularAutomata?BecauseCellularAutomataareastand-inforanysufficientlydetailedcomplicatedontologicalexplanationforhowtheworldworks.IssuesinOrderAddressedBooleanAlgebraLogicFunctionsCellularAutomataWhyStartwithBooleanAlgebra?ThefollowingfewslidesonBooleanAlgebraaresolelytosetthestageforanalogousoperationswithclassicallogicfunctions(andcellularautomata).SomeBasicBooleanQuestionsHowareBooleanfunctionsdefined?HowaresyntacticallycorrectBooleanformulasproduced?WhatisagoodcanonicalexpressionforBooleanfunctions?WhyIsItHelpful?UsefulforbothlogicfunctionsandcellularautomataAxiomsofBooleanAlgebrausedinBayes’sTheoremCanonicalexpressionssubstitutedforcomplicatedlogicandCArulesFormalRules,BooleanAlgebra,andProbabilityTheoryPerfectchoicefordiscussingformalmanipulationrulesofprobabilitytheorywheretheactualnumericalassignmentsarenottheissue.BooleanAlgebraonafinitecarriersetisa“closed”system,thatis,thereisalwaysananswer.Moreover,neithernumbersnorarithmeticoperationsarerequiredtofindthatanswer.BooleanAlgebraThecarriersetBinaryoperatorsSpecialElementsFunctiondefinition:Amappingfromthesetoforderedpairsofthecarriertoanelementinthecarrierset.CharacterizedbythequintupleBooleanAlgebraAnexampleofacarriersetwithfourelementsAll16orderedpairsfromthecarriersetAmappingfromanelementofBxBintoanelementofBExampleofBooleanFunctionFunctionTableBooleanFormulaSubstitutespecificargumentsBoole’sExpansionTheoremAnyBooleanfunctioncanbeexpandedinthefollowingmanner.Applyingthistheoreminarecursivemanneryieldsthedisjunctivenormalform(DNF).DisjunctiveNormalFormForexample,hereistheexpansionofanyBooleanfunction

f(x,y)

with

n=2

arguments.Thesearecalledthediscriminants.DisjunctiveNormalFormCalculatediscriminantsandthensubstituteRepeatinggenericexpansionfrompreviousslideIssuesinOrderAddressedBooleanAlgebraLogicFunctionsCellularAutomataLogicFunctionsAspecialcaseofBooleanAlgebraDifferentNotationFunctionswithtwoargumentswritteningenericBooleanAlgebranotationandtheninClassicalLogicnotation.Boole’sExpansionTheoremUsingBoole’sexpansiontheorem,theDNFforanylogicfunctionnowlookslike,TheDNFforLogicFunctionsSincethediscriminantsalwaystakeafunctionalassignmentofeitherTRUEorFALSE,atypicalexpansionmightlooksomethinglikethis,ThelogicfunctionthatreturnsBwhenargumentsAandBgiven.f10(A,B)onnextslide.All16LogicFunctionsClassicalSyllogismModusPonensAisTRUEAimpliesBTherefore,BisTRUEClassicalSyllogismRecapitulateJaynes’sdemonstrationgeneralizingclassicallogicwithprobabilitytheory(buthereIemphasizetheBooleanAlgebraaspects).

**Chapter2,pp.35--36GeneralizingClassicalLogicBayes’sTheoremSubstituteDNFexpansionofImplicationfunctionABBooleanoperationsreduceabovetoModusPonensSubstitutetheshortenedDNFexpansionfortheimplicationfunctioninBayes’sTheoremBayes’sTheoremnowlookslikethisModusPonensBooleanoperationsondenominatorBooleanoperationsonnumeratorBayes’sTheoremDifferentApproachNowsolvemodusponensusingajointprobabilitytable.

Theanswershouldbethesame.JointProbabilityTableTwostatementsAandBeachtakeononlytwovalues.Therearefourcellsinthejointprobabilitytable.ThemodelassigningthesenumericalvaluesistheimplicationfunctionAB.JointProbabilityTableThesameanswerasbefore.ThemodelMkassignslegitimatenumericalvaluestothejointstatementsinthefourcellsofthejpt.Themodelistheimplicationfunction.Cell1Cell1Cell3ProbabilityTheoryGeneralizesClassicalLogicAssumethesamelogicfunction,butnowBisTRUE.

WhatistheimpactonA?Hereisan“invalid’’logicalargument,butonethatiseasilysolvedusingprobabilitytheoryinexactlythesamemannerasbefore.The“Invalid”LogicalArgumentSolvedbyProbabilityTheoryUsethenumericalassignmentsfromthejointprobabilitytable.Probabilitytheoryasageneralizationoflogicreturnsananswer,whileclassicallogicrefusestoaddresstheissuecallingit“undecidable.”Placementof0sinJPTCell3indexesjointstatement:AisTRUEandBisFALSE.f13(A,B)hasfunctionalassignmentofFALSEifAisTRUEandBisFALSEbyverydefinitionofoperator.

Therefore,cell3MUSTHAVEanumericalassignmentof0underthismodel.IssuesinOrderAddressedBooleanAlgebraLogicFunctionsCellularAutomataElementaryOne-DimensionalCellularAutomataWolfram’sfamousexampleofaCAproventobeaUniversalTuringMachineElementaryOne-DimensionalCellularAutomataFirstfewstepsofaCAfollowingRule110ManyStepsofCAFollowingRule110InteractingLocalizedStructures.Theycomputeanythingthatcanbecomputed!!Ourstand-inforacomplicateddetailedontologicalmodeloftheworld.LogicFunctionswithThreeVariablesButRule110issimplyalogicfunctionwiththreeargumentsinsteadofthetwoargumentsaswehaveexaminedpreviouslyindiscussingclassicallogic.Thereareatotalof256possiblelogicfunctionswiththreevariablesandRule110isoneofthose256functions.HereisRule110’sfunctiontableforalleightpossiblesettingsofthethreevariables.BlackTWhiteFTheDNFforRule110And,likeanylogicfunction,Rule110canbeexpandedviatheDNF.TheDNFexpansionofathreevariablelogicfunction,Rule110.TheDNFand0sintheJPTAnd,justaswedidwhenexaminingmodusponens,wecanusetheDNFexpansionofalogicfunctiontolocatethe0sinajointprobabilitytable.WewillemploythejptasaneasieralternativetotheformalBooleanoperationsinsolvingBayes’sTheoremappliedtoCA.JointProbabilityTablewithNumericalAssignmentsFollowingRule110Placementof0sdictatedbymodelfollowinglogicfunctionf110(A,B,C)JointProbabilityTablewithNumericalAssignmentsFollowingRule110BN+1cannotbeTRUE

(black)ifAN,BNandCNarealsoTRUE

(black)JointProbabilityTablewithNumericalAssignmentsFollowingRule110TheDNFexpansionofRule110alsotellsuswherethenon-0smustbeplaced.IffunctionalassignmentBN+1isTRUEatthesefiveterms,non-zeroprobabilityisassigned.Or,0sareplacedwherefunctionalassignmentis

FALSE.Bayes’sTheoremforRule110Writeoutthegenerictemplateforupdatingastateofknowledge(Bayes’sTheorem,ofcourse)aboutthecelltobeupdatedgiventhecolorsofthreecellsattheprevioustimestepandthenumericalassignmentfollowingRule110.UpdatingColorofCellinCAUsingBayes’sTheoremLocateandinsertvaluesfromjpt.InsertthenumericalassignmentfromCell12inthenumeratorandthenumericalassignmentfromCells12and4inthedenominator.Bayes’sTheoremwithdenominatorexpanded.NumericalassignmentfollowsfrommodelimplementingRule110.WhatisthePoint?Jaynesgeneralizedlogicfunctions(Booleanfunctions)bytreatingthemfromaprobabilisticandinferentialstandpoint.CAarecomposedofBooleanfunctions,sothinkofthemnotfromthedeductiveviewpoint,butratherfromaninformationalstandpoint.Forexample,letawiderangeofmodelsinsertlegitimatenumericalvaluesintothecellsofajointprobabilitytableforaCA.SupposethereisalackofinformationaboutwhichmodelcorrectlygovernstheevolutionoftheCA.Then,asaconsequenceensuingforallinformationalsystems,predictionatleastbecomesafeasibleconcepttoexplore.DifferentModelsAssignDifferentNumericalValues“Almost”themodel.

HowDoWePredictFutureEventsinanInferentialSystem?Weusethesameformalmanipulationruleswealwaysuseinprobabilitytheory.Forexample,toupdateastateofknowledgeaboutsomefutureeventFEconditionedonsomeobserveddataD

andinvolvingmodelsassigningnumericalvaluesMkPredictingFutureEventsinCATheinferentialapproachprovidesaquantitativewayfortheinformationprocessortoupdateitsstateofknowledgeaboutthecolorofanycellinthecellularautomaton.Here,wehavelostinformationaboutwhichmodel(rule)isgoverningtheevolutionoftheCA.Wemustaverageoverthepredictionsmadeby256modelsPredictingManyCellsoftheCAJointprobabilitytableisimpossiblyhuge!(Andanysummationishardtoo!)ThepredictionformulaforupdatingarbitrarilymanycellsoftheCA.AnyExistingSolutions?

Wehavetomakethedifficulttransitionfrommicro-eventstomacro-eventsintryingtopredictthefarfutureforCA.Historically,StatisticalPhysicsfacedthesameproblem.Macro-StatementsArePredictedbyInferentialApproach*SeeJaynes,Chapter18,fordiscussion.Macro-Statementsintheformoffuturefrequencycountscanbepredictedconditionedonpastfrequencycounts.*UsefulforCA?ThesameanalyticalapparatuscouldbeappliedtopredictfrequencycountsofblackandwhitecellsforeachofncellsatsomefutureMthtimestep.Butisthistypeofmacro-statementoneWolframwouldacceptasmeaningful?(Whathasbeenvoluntarilydiscardedmightbeviewedasveryimportant!)CanTechniquesfromInformationGeometryHelp?UseconceptsfromInformationGeometry.

Try

a-projectionfromcomplicatedprobabilitydistributionatpointPingeneralmanifoldtocomputationallytractabledistributionatpointQwithinsub-manifold.(Amari)MaximumEntropyPrinciplewithmeasurefunctionm(x)(Jaynes)MeanFieldApproximationinStatisticalPhysicsBeliefPropagationalgorithmsSinequanonofpredictingInordertopredict,micro-informationmustbevoluntarilydiscarded!ImplicationsforCAWhatkindofmicro-informationshouldbediscarded?Whatkindofmacro-statementsmakesenseforCA?MyMainArgumentWolframispessimisticaboutbeingabletopredictthebehaviourof

deductivesystems

likecellularautomataintothefarfuture.

Heiscorrect.However,(followingJaynes)ifCAaretreatedfromtheperspectiveof

inferenceandinformation,

thenalimitedformofpredictionbecomespossible.Thismeansthatwemustemploy

probabilitytheoryasthegeneralizationofclassicallogic,

thatis,weuseinferenceinsteadofdeduction.It’sarepetitionoftheold

analogyfromstatisticalmechanics.Wevoluntarilygiveupinformationaboutthemicrodetailsofmoleculardynamicsinexchangefortheabilitytopredictmacrovariables.Themoral:WeMUSTapproachtheproblemof

predictingtheconsequencesofanysufficientlydetailedexplanatorymodeloftheworld

throughinferenceandinformation.SummaryofTechnicalPointsBooleanfunctionsf(x1,x2,…xn)=f:Bn

Bforanynumberofvariables.Abstract,general,closed,donotinvolvenumbersorarithmeticoperations,andareeasytocomprehend.Talkfocusedonn=2(CL)andn=3(CA).Perfectfoilforprobabilitytheory’sformalmanipulationrules.SummaryofTechnicalPointsAnysuchBooleanfunctioncanbeexpandedintotheDisjunctiveNormalForm.AclassicallogicfunctionisaBooleanfunctionandcanbeexpressedviatheDNF.Logicproblems(classicalsyllogisms)canbesolvedbyprobabilitytheory.Jointprobabilitytablesillustratehowsomemodela

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫網(wǎng)僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時也不承擔(dān)用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。

評論

0/150

提交評論