Mathematics - Copeman Academy2020-02-18T01:49:20Zhttp://Copeman.ning.com/mathematics/feed/allM205 Markov Processeshttp://Copeman.ning.com/mathematics/m205-markov-processes2019-12-05T16:08:18.000Z2019-12-05T16:08:18.000ZPhilip Copemanhttp://Copeman.ning.com/members/PhilipCopeman<div><p>Copeman's Process of Internet Triangularisation</p>
<p>CPIT</p>
<p>Raison d'état</p>
<p>For any Internet transaction S2 -> S3 that is a CPIT, by offering the service of attaining the transaction S2 -> S1 -> S3, the service provider creates scalar value.</p>
<p><br />Definition</p>
<p>Copeman's Process of Internet Triangularisation (CPIT) is a term, created by Philip Copeman of the TurboCASH Project, that describes an Internet Transaction as a Markov Process separable into multiple-order Markov Processes each with a scalar cost that cumulatively obtains an equal state but where the cumulative costs of the new cpit processes are less than the original process, CPIT</p>
<p><br />CPIT < Sigma cpit(i) for a process with the order i where the cost of change of state can be measured as a scalar aij.</p>
<p><br />Apparent Paradox<a href="http://storage.ning.com/topology/rest/1.0/file/get/3756459088?profile=RESIZE_710x" target="_blank"><img class="align-full" src="http://storage.ning.com/topology/rest/1.0/file/get/3756459088?profile=RESIZE_710x" width="595" alt="3756459088?profile=RESIZE_710x" /></a></p>
<p>The sum of the parts is less than the whole. This is only an illusion, caused by lack of visualisation of order.</p>
<p><br />Example</p>
<p><br />10,000 customers turning over R 1,0000,000 each have a joint turnover of 10,000 * R 1 M = R 10 Bn. These transactions require accounting and auditing. Typically this costs these users 3 to 5% of Turnover. The 10,000 users are thus paying north of R10Bn * ).03 = R 300,000 M. If this process is replaced with multiple processes, that achieve the same audit quality at a cost of R 200,000 then the process of auditing such a group of transactions is a CPIT with a scalar value of R 100,000.</p>
<p>Reference</p>
<p>A Markov process is a stochastic model, in continuous-time, describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. (Wikipedia)</p>
<p>Illustration</p>
<p>In the second-order Markov Process S, The transaction from State S2 to State S3 namely a23 is a CPIT if a21 +a13 < a23</p></div>M201 Game Theoryhttp://Copeman.ning.com/mathematics/m201-game-theory2018-09-12T08:40:04.000Z2018-09-12T08:40:04.000ZPhilip Copemanhttp://Copeman.ning.com/members/PhilipCopeman<div><p> </p>
<p>The Prisoners Dilemma</p>
<p>Wikipedia</p>
<p><a href="https://en.wikipedia.org/wiki/Prisoner%27s_dilemma" target="_blank" rel="noopener">https://en.wikipedia.org/wiki/Prisoner%27s_dilemma</a></p>
<p><a href="https://storage.ning.com/topology/rest/1.0/file/get/124952506?profile=original" target="_blank" rel="noopener"><img class="align-full" src="https://storage.ning.com/topology/rest/1.0/file/get/124952506?profile=RESIZE_710x" width="710" /></a></p>
</div>