博文
- Final Step In Proof Of 3 X + 1 Continued
- The Unrepeatable Function The unrepeatable function is NRF (P) = { 3 ^ (a - 1) + 3 ^ (a - 2) x 2 ^ r (1) + 3 ^ (a - 3) x 2 ^ r (1) x 2 ^ r (2) + ..... + + ..... + + } / { - 3 ^ a } where a is an integer for the munber of 3 X + 1 advance operations, ...
- Final Step In Proof Of 3 X + 1
- Youneedtoestablishtwofunctions Thefirstisunrepeatablefunction, whichdetermineorprovethat theoddnumbersitgothroughareneverrepeatable; &nbs ...
- A Simple Partial Proof Of 3X + 1 Problem
- 1.ItsatisfyconstantCyouchoose; 2.SupposeitsatisfyanyintegernwhenXn; 3.WhenX=n+1,ifnisodd,itsatisfy&nbs ...
- A Generic Proof Of P != NP
- AGenericProofOfP!=NP Supposeadecisionproblemf(n)isBoolean(NP), itstimecomplexityisn^c,wherec=acontant. Whennincreases,& ...
- P and NP Problem Continued
- Byonedefinition, PistheproblemsovableinpolynomialtimeusingDTM, NPistheproblemsovableinpolynomialtimeusingNDTM. Basically,NDTMisa ...
- Hamiltonian Problem Is Exponential
- Posa'sHamiltonianalgorithmoranyotheralgorithm isatleastexponential. Ireadsomeone'sblogdoingthisalgorithm, unfortunately,thisisatypicalexponentialalgorithm ...
- Time Complexity Is Purely Theoretical
- TimeComplexityIsPurelyTheoretical, Yes,thisistrue,nomatterwhatcomputingstructuresareused, timecomplexitywillnotchange. YoucanuseDTMorother&nbs ...
- Why Satisfiaility Problem Is Not A NP Problem
- WhyIsSatisfiailityProblemNotANPProblem? Becausebysomedefinition,poynomialtimeverificationisnotalwayssatisfied. Toshowwhy,supposethatits'sim ...
- P AND NP RELATED TIME ANALYESES
- OntheSummmaryofPandNPproblem, takenoticeofthefollowingimportantpoints: 1.Thisproblemisacomplexproblem, composedoftwodifferentpartsor ...
- Factors Of Boat's Final Position
- Youhavehadalotofdebatesonthefinalposition ofboatman'sboat. Therearemanyfactorsthatwillhaveimpactonthis. Basically,theyare: 1.Thespeedof ...
