PDA

View Full Version : [SOLVED] EEQT (was: 't Hooft in Duisburg-Essen)


Arnold Neumaier
Jul30-04, 11:43 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\n\nArkadiusz Jadczyk wrote:\n\n&gt; In EEQT the probabilistic interpretation of the ordinary quantum\n&gt; mechanics can be derived IF the experiment can be repeated infinitely\n&gt; many time. But EEQT deals with a single system that is aware of its own\n&gt; state (self-observation).\n\nHmm. I don\'t buy that.\n\nI read your recommended reference\n&gt; http://quantumfuture.net/quantum_future/papers/petruc/petruc.html\ndescribing EEQT in more detail. The dynamics is defined on p.13 of the\npdf file from quant-ph/9812081 that is mentioned there. Contrary to your\nclaim quoted above, EEQT is a stochastic process, which means it is\nnot defined for a single system but only for an ensemble of identically\nprepared systems. For a single system you cannot apply probabilities,\nbut you need them in your algorithm. Any piecewise deterministic\nHamiltonian dynamics will be a realization of your process, no matter\nwhen, how often, or where one jumps.\n\nStochastic processes only make assertions about _all_ realizations\nsimultaneously, and are (almost) silent about single realizations,\njust as a sequence of sixes only is a valid realization of the\ntrivial discrete stochastic process defining ideal dice throwing.\n\n(Also, you postulate a probabilistic formula which is essentially an\namplitude-squared formula; hence it is no surprise that you can derive\nthe probabilistic interpretation of QM from it.)\n\n\nArnold Neumaier\n\n\nPS. I thought you had promised an answer to my collapse challenge\nat http://www.mat.univie.ac.at/~neum/collapse.html in terms of EEQT!?\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>Arkadiusz Jadczyk wrote:

> In EEQT the probabilistic interpretation of the ordinary quantum
> mechanics can be derived IF the experiment can be repeated infinitely
> many time. But EEQT deals with a single system that is aware of its own
> state (self-observation).

Hmm. I don't buy that.

I read your recommended reference
> http://quantumfuture.net/quantum_future/papers/petruc/petruc.html
describing EEQT in more detail. The dynamics is defined on p.13 of the
pdf file from http://www.arxiv.org/abs/quant-ph/9812081 that is mentioned there. Contrary to your
claim quoted above, EEQT is a stochastic process, which means it is
not defined for a single system but only for an ensemble of identically
prepared systems. For a single system you cannot apply probabilities,
but you need them in your algorithm. Any piecewise deterministic
Hamiltonian dynamics will be a realization of your process, no matter
when, how often, or where one jumps.

Stochastic processes only make assertions about _all_ realizations
simultaneously, and are (almost) silent about single realizations,
just as a sequence of sixes only is a valid realization of the
trivial discrete stochastic process defining ideal dice throwing.

(Also, you postulate a probabilistic formula which is essentially an
amplitude-squared formula; hence it is no surprise that you can derive
the probabilistic interpretation of QM from it.)


Arnold Neumaier


PS. I thought you had promised an answer to my collapse challenge
at http://www.mat.univie.ac.at/~neum/collapse.html in terms of EEQT!?

Arkadiusz Jadczyk
Jul31-04, 09:15 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>On 30 Jul 2004 12:43:15 -0400, Arnold Neumaier\n&lt;Arnold.Neumaier@univie.ac.at&gt; wrote:\n\n&gt;Hmm. I don\'t buy that.\n\nYou do not need to buy it. You do not need to buy number theory either.\n\n\n&gt;I read your recommended reference\n&gt;&gt; http://quantumfuture.net/quantum_future/papers/petruc/petruc.html\n&gt;describing EEQT in more detail. The dynamics is defined on p.13 of the\n&gt;pdf file from quant-ph/9812081 that is mentioned there. Contrary to your\n&gt;claim quoted above, EEQT is a stochastic process,\n\nThis is not to the contrary, this is in agreement with my claim.\n\n&gt; which means it is\n&gt;not defined for a single system but only for an ensemble of identically\n&gt;prepared systems.\n\nNot in the least. You can run random number generator once. Or three\ntimes. Or five. Therefore it is perfectly defined for one system.\n\n&gt; For a single system you cannot apply probabilities,\n&gt;but you need them in your algorithm.\n\nI need a random number generator. That is all I need. It is well known\nthat chaotic dynamics can produce random sequences practically\nindistinguishable from random ones. Do you mean that there is no way to\ngenerate a random number? Everybody does it. Probably you will complain\nabout pseudo-random rather than random? Well, pseudo-random exist, and\nchaotic systems exist. I am happy with them.\n\n\nAny piecewise deterministic\n&gt;Hamiltonian dynamics will be a realization of your process, no matter\n&gt;when, how often, or where one jumps.\n\nThat is another incorrect statement. Or, perhaps, you would like to\nprovide a formal proof of the above?\n\n\n&gt;Stochastic processes only make assertions about _all_ realizations\n&gt;simultaneously, and are (almost) silent about single realizations,\n&gt;just as a sequence of sixes only is a valid realization of the\n&gt;trivial discrete stochastic process defining ideal dice throwing.\n\nI am not talking about "ideal dice". I do not think there is even a\ndefinition of such. I am happy with pseudo-random sequences that comes\nout of chaotic dynamics.\n\n&gt;(Also, you postulate a probabilistic formula which is essentially an\n&gt;amplitude-squared formula; hence it is no surprise that you can derive\n&gt;the probabilistic interpretation of QM from it.)\n\nI am not postulating this formula. Probably you did not really read the\npapers. The formula is derived from the Liouville equation and Linblad\'s\ndynamics.\n\n&gt;\n&gt;Arnold Neumaier\n&gt;\n&gt;\n&gt;PS. I thought you had promised an answer to my collapse challenge\n&gt;at http://www.mat.univie.ac.at/~neum/collapse.html in terms of EEQT!?\n\nI did. But there was no time framework set. As it happened with quantum\njumps, the timing is the result of "dice throwing" - or, if you wish, of\nan infinitely complex dynamics.\n\nark\n\n--\n\nArkadiusz Jadczyk\nhttp://quantumfuture.net/quantum_future/homepage.htm\n\n--\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>On 30 Jul 2004 12:43:15 -0400, Arnold Neumaier
<Arnold.Neumaier@univie.ac.at> wrote:

>Hmm. I don't buy that.

You do not need to buy it. You do not need to buy number theory either.


>I read your recommended reference
>> http://quantumfuture.net/quantum_future/papers/petruc/petruc.html
>describing EEQT in more detail. The dynamics is defined on p.13 of the
>pdf file from http://www.arxiv.org/abs/quant-ph/9812081 that is mentioned there. Contrary to your
>claim quoted above, EEQT is a stochastic process,

This is not to the contrary, this is in agreement with my claim.

> which means it is
>not defined for a single system but only for an ensemble of identically
>prepared systems.

Not in the least. You can run random number generator once. Or three
times. Or five. Therefore it is perfectly defined for one system.

> For a single system you cannot apply probabilities,
>but you need them in your algorithm.

I need a random number generator. That is all I need. It is well known
that chaotic dynamics can produce random sequences practically
indistinguishable from random ones. Do you mean that there is no way to
generate a random number? Everybody does it. Probably you will complain
about pseudo-random rather than random? Well, pseudo-random exist, and
chaotic systems exist. I am happy with them.


Any piecewise deterministic
>Hamiltonian dynamics will be a realization of your process, no matter
>when, how often, or where one jumps.

That is another incorrect statement. Or, perhaps, you would like to
provide a formal proof of the above?


>Stochastic processes only make assertions about _all_ realizations
>simultaneously, and are (almost) silent about single realizations,
>just as a sequence of sixes only is a valid realization of the
>trivial discrete stochastic process defining ideal dice throwing.

I am not talking about "ideal dice". I do not think there is even a
definition of such. I am happy with pseudo-random sequences that comes
out of chaotic dynamics.

>(Also, you postulate a probabilistic formula which is essentially an
>amplitude-squared formula; hence it is no surprise that you can derive
>the probabilistic interpretation of QM from it.)

I am not postulating this formula. Probably you did not really read the
papers. The formula is derived from the Liouville equation and Linblad's
dynamics.

>
>Arnold Neumaier
>
>
>PS. I thought you had promised an answer to my collapse challenge
>at http://www.mat.univie.ac.at/~neum/collapse.html in terms of EEQT!?

I did. But there was no time framework set. As it happened with quantum
jumps, the timing is the result of "dice throwing" - or, if you wish, of
an infinitely complex dynamics.

ark

--

Arkadiusz Jadczyk
http://quantumfuture.net/quantum_future/homepage.htm

--

Arnold Neumaier
Aug12-04, 08:30 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\n\n\nArkadiusz Jadczyk wrote:\n&gt; On 30 Jul 2004 12:43:15 -0400, Arnold Neumaier\n&gt; &lt;Arnold.Neumaier@univie.ac.at&gt; wrote:\n&gt;\n&gt;&gt;I read your recommended reference\n&gt;&gt;\n&gt;&gt;&gt;http://quantumfuture.net/quantum_future/papers/petruc/petruc.html\n&gt;&gt;\n&gt;&gt;describing EEQT in more detail. The dynamics is defined on p.13 of the\n&gt;&gt;pdf file from quant-ph/9812081 that is mentioned there. Contrary to your\n&gt;&gt;claim quoted above, EEQT is a stochastic process,\n&gt;\n&gt; This is not to the contrary, this is in agreement with my claim.\n\nHmm. But a stochastic process only makes assertions about large\nensembles of identically prepared systems, namely about expectations\nand probabilities of occurence. Probabilities of single events are\nmeaningless.\n\n\n&gt;&gt;which means it is\n&gt;&gt;not defined for a single system but only for an ensemble of identically\n&gt;&gt;prepared systems.\n&gt;\n&gt; Not in the least. You can run random number generator once. Or three\n&gt; times. Or five. Therefore it is perfectly defined for one system.\n\nA random number generator only simulates a stochastic process\n(of identically distributed numbers). If you run a binary random number\ngenerator once, it just gives you 0 or 1, and not both with a certain\nprobability. To say the 1 occured with probability 1/2 makes only sense\nif you consider large ensembles...\n\n\n&gt;&gt;For a single system you cannot apply probabilities,\n&gt;&gt;but you need them in your algorithm.\n&gt;\n&gt; I need a random number generator. That is all I need.\n\nBut this is already importing ensembles. Any finite sequence of numbers\ncould have been produced by a number generator; if you only have a single\ninstance, there is no sure way of telling different sequences apart.\n\n\n&gt; It is well known\n&gt; that chaotic dynamics can produce random sequences practically\n&gt; indistinguishable from random ones.\n\nOnce one allows FAPP arguments in the foundations of QM, all problems\nare gone. The question is whether there is a way to avoid the FAPP\narguments.\n\n\n&gt; Do you mean that there is no way to\n&gt; generate a random number? Everybody does it. Probably you will complain\n&gt; about pseudo-random rather than random? Well, pseudo-random exist, and\n&gt; chaotic systems exist. I am happy with them.\n\nThey exist only given an underlying deterministic system.\nWhere is that in EEQT?\n\n\n&gt;&gt;Any piecewise deterministic\n&gt;&gt;Hamiltonian dynamics will be a realization of your process, no matter\n&gt;&gt;when, how often, or where one jumps.\n&gt;\n&gt; That is another incorrect statement. Or, perhaps, you would like to\n&gt; provide a formal proof of the above?\n\nThis is the case since there is a nonvanishing probability for generating\nthe realization given your setting. It is like the fact that a random\nbit generator generates the finite sequence 111111111...111\nevery once in a (long) while.\n\nArbitrary finite realizations of stochastic processes simply do not\nconvey necessarily information about the generating process. Thus the\nsame realization can be associated to many processes.\n\nThis is well-known in statistics. Therefore there one has elaborate\ntechniques to assign the (in a technical, nonprobabilistic sense)\nmost likely process giving rise to a given realization.\nAnd 11111....111 would be most likely be generated not by the random\nbit process (although in fact it was generated by our random number\ngenerator) but by the sticky bit process.\n\nMy conjecture is that things in QM need a similar point of view.\nSeen from such an angle, there is little fundamental difference\nbetween the Copenhagen interpretation and your EEQT - both need some\nclassical information and statistical techniques to deduce the most\nlikely underlying scenario.\n\n\n&gt;&gt;Stochastic processes only make assertions about _all_ realizations\n&gt;&gt;simultaneously, and are (almost) silent about single realizations,\n&gt;&gt;just as a sequence of sixes only is a valid realization of the\n&gt;&gt;trivial discrete stochastic process defining ideal dice throwing.\n&gt;\n&gt; I am not talking about "ideal dice". I do not think there is even a\n&gt; definition of such. I am happy with pseudo-random sequences that comes\n&gt; out of chaotic dynamics.\n\nBut how is this chaotic system represented in you EEQT?\nMust be by a sort of hidden variables about which you don\'t give any\ndetails!?\n\n\n&gt;&gt;(Also, you postulate a probabilistic formula which is essentially an\n&gt;&gt;amplitude-squared formula; hence it is no surprise that you can derive\n&gt;&gt;the probabilistic interpretation of QM from it.)\n&gt;\n&gt; I am not postulating this formula. Probably you did not really read the\n&gt; papers. The formula is derived from the Liouville equation and Linblad\'s\n&gt; dynamics.\n\nI really read the paper. You state on p. 12 of quant-ph/9812081\nyour PDP Algorithm 1, in which the jump probabilities fall from heaven.\nYou say in the context that it can be proved that averaging this\ngives a Lindblad dynamics. But this is deriving Lindblad from your\nassumptions, and not the other way around, as you claimed above.\n\nI don\'t deny that the formula will work. I only noted that it starts with\nmachinery that is already complex enough so that it is no surprise\nthat you can derive the probabilistic interpretation of QM from it.\n\n\nArnold Neumaier\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>Arkadiusz Jadczyk wrote:
> On 30 Jul 2004 12:43:15 -0400, Arnold Neumaier
> <Arnold.Neumaier@univie.ac.at> wrote:
>
>>I read your recommended reference
>>
>>>http://quantumfuture.net/quantum_future/papers/petruc/petruc.html
>>
>>describing EEQT in more detail. The dynamics is defined on p.13 of the
>>pdf file from http://www.arxiv.org/abs/quant-ph/9812081 that is mentioned there. Contrary to your
>>claim quoted above, EEQT is a stochastic process,
>
> This is not to the contrary, this is in agreement with my claim.

Hmm. But a stochastic process only makes assertions about large
ensembles of identically prepared systems, namely about expectations
and probabilities of occurence. Probabilities of single events are
meaningless.


>>which means it is
>>not defined for a single system but only for an ensemble of identically
>>prepared systems.
>
> Not in the least. You can run random number generator once. Or three
> times. Or five. Therefore it is perfectly defined for one system.

A random number generator only simulates a stochastic process
(of identically distributed numbers). If you run a binary random number
generator once, it just gives you or 1, and not both with a certain
probability. To say the 1 occured with probability 1/2 makes only sense
if you consider large ensembles...


>>For a single system you cannot apply probabilities,
>>but you need them in your algorithm.
>
> I need a random number generator. That is all I need.

But this is already importing ensembles. Any finite sequence of numbers
could have been produced by a number generator; if you only have a single
instance, there is no sure way of telling different sequences apart.


> It is well known
> that chaotic dynamics can produce random sequences practically
> indistinguishable from random ones.

Once one allows FAPP arguments in the foundations of QM, all problems
are gone. The question is whether there is a way to avoid the FAPP
arguments.


> Do you mean that there is no way to
> generate a random number? Everybody does it. Probably you will complain
> about pseudo-random rather than random? Well, pseudo-random exist, and
> chaotic systems exist. I am happy with them.

They exist only given an underlying deterministic system.
Where is that in EEQT?


>>Any piecewise deterministic
>>Hamiltonian dynamics will be a realization of your process, no matter
>>when, how often, or where one jumps.
>
> That is another incorrect statement. Or, perhaps, you would like to
> provide a formal proof of the above?

This is the case since there is a nonvanishing probability for generating
the realization given your setting. It is like the fact that a random
bit generator generates the finite sequence 111111111...111
every once in a (long) while.

Arbitrary finite realizations of stochastic processes simply do not
convey necessarily information about the generating process. Thus the
same realization can be associated to many processes.

This is well-known in statistics. Therefore there one has elaborate
techniques to assign the (in a technical, nonprobabilistic sense)
most likely process giving rise to a given realization.
And 11111....111 would be most likely be generated not by the random
bit process (although in fact it was generated by our random number
generator) but by the sticky bit process.

My conjecture is that things in QM need a similar point of view.
Seen from such an angle, there is little fundamental difference
between the Copenhagen interpretation and your EEQT - both need some
classical information and statistical techniques to deduce the most
likely underlying scenario.


>>Stochastic processes only make assertions about _all_ realizations
>>simultaneously, and are (almost) silent about single realizations,
>>just as a sequence of sixes only is a valid realization of the
>>trivial discrete stochastic process defining ideal dice throwing.
>
> I am not talking about "ideal dice". I do not think there is even a
> definition of such. I am happy with pseudo-random sequences that comes
> out of chaotic dynamics.

But how is this chaotic system represented in you EEQT?
Must be by a sort of hidden variables about which you don't give any
details!?


>>(Also, you postulate a probabilistic formula which is essentially an
>>amplitude-squared formula; hence it is no surprise that you can derive
>>the probabilistic interpretation of QM from it.)
>
> I am not postulating this formula. Probably you did not really read the
> papers. The formula is derived from the Liouville equation and Linblad's
> dynamics.

I really read the paper. You state on p. 12 of http://www.arxiv.org/abs/quant-ph/9812081
your PDP Algorithm 1, in which the jump probabilities fall from heaven.
You say in the context that it can be proved that averaging this
gives a Lindblad dynamics. But this is deriving Lindblad from your
assumptions, and not the other way around, as you claimed above.

I don't deny that the formula will work. I only noted that it starts with
machinery that is already complex enough so that it is no surprise
that you can derive the probabilistic interpretation of QM from it.


Arnold Neumaier

Arkadiusz Jadczyk
Aug16-04, 12:55 PM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\nOn 12 Aug 2004 09:30:02 -0400, Arnold Neumaier\n&lt;Arnold.Neumaier@univie.ac.at&gt; wrote:\n\n&gt;Hmm. But a stochastic process only makes assertions about large\n&gt;ensembles of identically prepared systems, namely about expectations\n&gt;and probabilities of occurence. Probabilities of single events are\n&gt;meaningless.\n\nNo, stochastic process does not make any assertions whatsoever.\nMathematicians or physicists make assertions about stochastic processes.\n\n&gt;&gt;&gt;which means it is\n&gt;&gt;&gt;not defined for a single system but only for an ensemble of identically\n&gt;&gt;&gt;prepared systems.\n&gt;&gt;\n&gt;&gt; Not in the least. You can run random number generator once. Or three\n&gt;&gt; times. Or five. Therefore it is perfectly defined for one system.\n&gt;\n&gt;A random number generator only simulates a stochastic process\n&gt;(of identically distributed numbers). If you run a binary random number\n&gt;generator once, it just gives you 0 or 1, and not both with a certain\n&gt;probability. To say the 1 occured with probability 1/2 makes only sense\n&gt;if you consider large ensembles...\n\nLarge ensembles will not help. They need to be infinite. But nothing\ninfinite is at disposal of an experimentalist. Random generator is\npretty good to simulate real events, like a mathematical line is pretty\ngood to simulate real particle trajectory.\n\n\n&gt;&gt;&gt;For a single system you cannot apply probabilities,\n&gt;&gt;&gt;but you need them in your algorithm.\n&gt;&gt;\n&gt;&gt; I need a random number generator. That is all I need.\n&gt;\n&gt;But this is already importing ensembles. Any finite sequence of numbers\n&gt;could have been produced by a number generator; if you only have a single\n&gt;instance, there is no sure way of telling different sequences apart.\n\nYou can criticize the same way application of ANY mathematical concept\nto the real world. We always use models, idealizations and\napproximations.\n\n\n&gt;&gt; It is well known\n&gt;&gt; that chaotic dynamics can produce random sequences practically\n&gt;&gt; indistinguishable from random ones.\n&gt;\n&gt;Once one allows FAPP arguments in the foundations of QM, all problems\n&gt;are gone. The question is whether there is a way to avoid the FAPP\n&gt;arguments.\n\nThere is no way to avoid FAPP arguments. You can pretend you do not see\nthem, but someone will point them to you. But I do not agree that using\nFAPP automatically removes all problems. Some FAPP are better than\nother, and the devil is always in the details.\n\n\n&gt;&gt; Do you mean that there is no way to\n&gt;&gt; generate a random number? Everybody does it. Probably you will complain\n&gt;&gt; about pseudo-random rather than random? Well, pseudo-random exist, and\n&gt;&gt; chaotic systems exist. I am happy with them.\n&gt;\n&gt;They exist only given an underlying deterministic system.\n&gt;Where is that in EEQT?\n\nEEQT is an "event enhanced quantum theory". It does not pretend to be a\n"theory of everything". Therefore it makes models. Like in\nelectrodynamics, we know that electrons are not point particles, that\nthey have internal structure, but we neglect this structure and take\nonly as much as we really need to answer certain questions. For instance\nwe can even classically model "spin" of the electron (Bargman-Telegdi)\nwithout really knowing what is the "real nature of the spin".\n\n\n&gt;&gt;&gt;Any piecewise deterministic\n&gt;&gt;&gt;Hamiltonian dynamics will be a realization of your process, no matter\n&gt;&gt;&gt;when, how often, or where one jumps.\n&gt;&gt;\n&gt;&gt; That is another incorrect statement. Or, perhaps, you would like to\n&gt;&gt; provide a formal proof of the above?\n&gt;\n&gt;This is the case since there is a nonvanishing probability for generating\n&gt;the realization given your setting. It is like the fact that a random\n&gt;bit generator generates the finite sequence 111111111...111\n&gt;every once in a (long) while.\n\nProbably you mean that any particular sequence of jumps can be a\nrealization. Yes, this is true. And the is true about our world. So my\nmodel is a good model of the universe.\n\n\n&gt;Arbitrary finite realizations of stochastic processes simply do not\n&gt;convey necessarily information about the generating process. Thus the\n&gt;same realization can be associated to many processes.\n&gt;\n&gt;This is well-known in statistics. Therefore there one has elaborate\n&gt;techniques to assign the (in a technical, nonprobabilistic sense)\n&gt;most likely process giving rise to a given realization.\n&gt;And 11111....111 would be most likely be generated not by the random\n&gt;bit process (although in fact it was generated by our random number\n&gt;generator) but by the sticky bit process.\n\nI ma simply proposing the mechanism that Nature is using. And applying\nthis mechanisms allows us to predict more than the standard quantum\ntheory. Moreover, this mechanism is not in contradiction with\nobservations - as far as I know.\n\n&gt;My conjecture is that things in QM need a similar point of view.\n&gt;Seen from such an angle, there is little fundamental difference\n&gt;between the Copenhagen interpretation and your EEQT - both need some\n&gt;classical information and statistical techniques to deduce the most\n&gt;likely underlying scenario.\n\nThe difference is in the predictive power: for instance tunneling time,\ntime of arrival etc.\n\n&gt;\n&gt;&gt;&gt;Stochastic processes only make assertions about _all_ realizations\n&gt;&gt;&gt;simultaneously, and are (almost) silent about single realizations,\n&gt;&gt;&gt;just as a sequence of sixes only is a valid realization of the\n&gt;&gt;&gt;trivial discrete stochastic process defining ideal dice throwing.\n&gt;&gt;\n&gt;&gt; I am not talking about "ideal dice". I do not think there is even a\n&gt;&gt; definition of such. I am happy with pseudo-random sequences that comes\n&gt;&gt; out of chaotic dynamics.\n&gt;\n&gt;But how is this chaotic system represented in you EEQT?\n\nIt is represented by a random generator or by any chaotic system. As I\nsaid above EEQT does not pretend to be the theory of everything (though\nthe future theory of everything may use some of the concepts of EEQT)\n\n\n&gt;Must be by a sort of hidden variables about which you don\'t give any\n&gt;details!?\n\nYes. This is one possibility. But being specific will not change\nanything about the predictions of EEQT concerning the standard\nexperimental questions of today.\n\n\n&gt;&gt;&gt;(Also, you postulate a probabilistic formula which is essentially an\n&gt;&gt;&gt;amplitude-squared formula; hence it is no surprise that you can derive\n&gt;&gt;&gt;the probabilistic interpretation of QM from it.)\n&gt;&gt;\n&gt;&gt; I am not postulating this formula. Probably you did not really read the\n&gt;&gt; papers. The formula is derived from the Liouville equation and Linblad\'s\n&gt;&gt; dynamics.\n&gt;\n&gt;I really read the paper. You state on p. 12 of quant-ph/9812081\n&gt;your PDP Algorithm 1, in which the jump probabilities fall from heaven.\n&gt;You say in the context that it can be proved that averaging this\n&gt;gives a Lindblad dynamics. But this is deriving Lindblad from your\n&gt;assumptions, and not the other way around, as you claimed above.\n\nAnother paper\n\nhttp://xxx.lanl.gov/abs/quant-ph/9512002\n\nhas the derivation from the Lindblad equation.\n\n\n&gt;I don\'t deny that the formula will work. I only noted that it starts with\n&gt;machinery that is already complex enough so that it is no surprise\n&gt;that you can derive the probabilistic interpretation of QM from it.\n\nWell, it is a surprise, because there are infinitely many machineries\nthat are complex and that do not lead to any good result!\n\nThanks for your criticism! It is always appreciated as it allows\nother readers to better understand the issues, and it allows me to\nbetter understand weak and strong points of my own theory :-)\n\nark\n\n--\n\nArkadiusz Jadczyk\nhttp://quantumfuture.net/quantum_future/jadpub.htm\n--\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>On 12 Aug 2004 09:30:02 -0400, Arnold Neumaier
<Arnold.Neumaier@univie.ac.at> wrote:

>Hmm. But a stochastic process only makes assertions about large
>ensembles of identically prepared systems, namely about expectations
>and probabilities of occurence. Probabilities of single events are
>meaningless.

No, stochastic process does not make any assertions whatsoever.
Mathematicians or physicists make assertions about stochastic processes.

>>>which means it is
>>>not defined for a single system but only for an ensemble of identically
>>>prepared systems.
>>
>> Not in the least. You can run random number generator once. Or three
>> times. Or five. Therefore it is perfectly defined for one system.
>
>A random number generator only simulates a stochastic process
>(of identically distributed numbers). If you run a binary random number
>generator once, it just gives you or 1, and not both with a certain
>probability. To say the 1 occured with probability 1/2 makes only sense
>if you consider large ensembles...

Large ensembles will not help. They need to be infinite. But nothing
infinite is at disposal of an experimentalist. Random generator is
pretty good to simulate real events, like a mathematical line is pretty
good to simulate real particle trajectory.


>>>For a single system you cannot apply probabilities,
>>>but you need them in your algorithm.
>>
>> I need a random number generator. That is all I need.
>
>But this is already importing ensembles. Any finite sequence of numbers
>could have been produced by a number generator; if you only have a single
>instance, there is no sure way of telling different sequences apart.

You can criticize the same way application of ANY mathematical concept
to the real world. We always use models, idealizations and
approximations.


>> It is well known
>> that chaotic dynamics can produce random sequences practically
>> indistinguishable from random ones.
>
>Once one allows FAPP arguments in the foundations of QM, all problems
>are gone. The question is whether there is a way to avoid the FAPP
>arguments.

There is no way to avoid FAPP arguments. You can pretend you do not see
them, but someone will point them to you. But I do not agree that using
FAPP automatically removes all problems. Some FAPP are better than
other, and the devil is always in the details.


>> Do you mean that there is no way to
>> generate a random number? Everybody does it. Probably you will complain
>> about pseudo-random rather than random? Well, pseudo-random exist, and
>> chaotic systems exist. I am happy with them.
>
>They exist only given an underlying deterministic system.
>Where is that in EEQT?

EEQT is an "event enhanced quantum theory". It does not pretend to be a
"theory of everything". Therefore it makes models. Like in
electrodynamics, we know that electrons are not point particles, that
they have internal structure, but we neglect this structure and take
only as much as we really need to answer certain questions. For instance
we can even classically model "spin" of the electron (Bargman-Telegdi)
without really knowing what is the "real nature of the spin".


>>>Any piecewise deterministic
>>>Hamiltonian dynamics will be a realization of your process, no matter
>>>when, how often, or where one jumps.
>>
>> That is another incorrect statement. Or, perhaps, you would like to
>> provide a formal proof of the above?
>
>This is the case since there is a nonvanishing probability for generating
>the realization given your setting. It is like the fact that a random
>bit generator generates the finite sequence 111111111...111
>every once in a (long) while.

Probably you mean that any particular sequence of jumps can be a
realization. Yes, this is true. And the is true about our world. So my
model is a good model of the universe.


>Arbitrary finite realizations of stochastic processes simply do not
>convey necessarily information about the generating process. Thus the
>same realization can be associated to many processes.
>
>This is well-known in statistics. Therefore there one has elaborate
>techniques to assign the (in a technical, nonprobabilistic sense)
>most likely process giving rise to a given realization.
>And 11111....111 would be most likely be generated not by the random
>bit process (although in fact it was generated by our random number
>generator) but by the sticky bit process.

I ma simply proposing the mechanism that Nature is using. And applying
this mechanisms allows us to predict more than the standard quantum
theory. Moreover, this mechanism is not in contradiction with
observations - as far as I know.

>My conjecture is that things in QM need a similar point of view.
>Seen from such an angle, there is little fundamental difference
>between the Copenhagen interpretation and your EEQT - both need some
>classical information and statistical techniques to deduce the most
>likely underlying scenario.

The difference is in the predictive power: for instance tunneling time,
time of arrival etc.

>
>>>Stochastic processes only make assertions about _all_ realizations
>>>simultaneously, and are (almost) silent about single realizations,
>>>just as a sequence of sixes only is a valid realization of the
>>>trivial discrete stochastic process defining ideal dice throwing.
>>
>> I am not talking about "ideal dice". I do not think there is even a
>> definition of such. I am happy with pseudo-random sequences that comes
>> out of chaotic dynamics.
>
>But how is this chaotic system represented in you EEQT?

It is represented by a random generator or by any chaotic system. As I
said above EEQT does not pretend to be the theory of everything (though
the future theory of everything may use some of the concepts of EEQT)


>Must be by a sort of hidden variables about which you don't give any
>details!?

Yes. This is one possibility. But being specific will not change
anything about the predictions of EEQT concerning the standard
experimental questions of today.


>>>(Also, you postulate a probabilistic formula which is essentially an
>>>amplitude-squared formula; hence it is no surprise that you can derive
>>>the probabilistic interpretation of QM from it.)
>>
>> I am not postulating this formula. Probably you did not really read the
>> papers. The formula is derived from the Liouville equation and Linblad's
>> dynamics.
>
>I really read the paper. You state on p. 12 of http://www.arxiv.org/abs/quant-ph/9812081
>your PDP Algorithm 1, in which the jump probabilities fall from heaven.
>You say in the context that it can be proved that averaging this
>gives a Lindblad dynamics. But this is deriving Lindblad from your
>assumptions, and not the other way around, as you claimed above.

Another paper

http://xxx.lanl.gov/abs/http://www.arxiv.org/abs/quant-ph/9512002

has the derivation from the Lindblad equation.


>I don't deny that the formula will work. I only noted that it starts with
>machinery that is already complex enough so that it is no surprise
>that you can derive the probabilistic interpretation of QM from it.

Well, it is a surprise, because there are infinitely many machineries
that are complex and that do not lead to any good result!

Thanks for your criticism! It is always appreciated as it allows
other readers to better understand the issues, and it allows me to
better understand weak and strong points of my own theory :-)

ark

--

Arkadiusz Jadczyk
http://quantumfuture.net/quantum_future/jadpub.htm
--

Arnold Neumaier
Aug19-04, 09:26 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\nArkadiusz Jadczyk wrote:\n&gt; On 12 Aug 2004 09:30:02 -0400, Arnold Neumaier\n&gt; &lt;Arnold.Neumaier@univie.ac.at&gt; wrote:\n&gt;\n&gt;\n&gt;&gt;Hmm. But a stochastic process only makes assertions about large\n&gt;&gt;ensembles of identically prepared systems, namely about expectations\n&gt;&gt;and probabilities of occurence. Probabilities of single events are\n&gt;&gt;meaningless.\n&gt;\n&gt; No, stochastic process does not make any assertions whatsoever.\n&gt; Mathematicians or physicists make assertions about stochastic processes.\n\nPicking on the language is not very constructive. But if you like,\nI can be more precise:\n\n\'\'From a stochstic process used to model a system, one can only infer\nproperties about large ensembles of identically prepared systems.\n(And only in the approximation that this ensemble is representative\nof the theoretical, infinite ensemble defined by the stochastic model.)\n\n\n&gt;&gt;A random number generator only simulates a stochastic process\n&gt;&gt;(of identically distributed numbers). If you run a binary random number\n&gt;&gt;generator once, it just gives you 0 or 1, and not both with a certain\n&gt;&gt;probability. To say the 1 occured with probability 1/2 makes only sense\n&gt;&gt;if you consider large ensembles...\n&gt;\n&gt; Large ensembles will not help. They need to be infinite.\n\nStrictly speaking, yes. But in the approximations physicists are\ngenerally working, this amounts to the same. In the limit of arbitrarily\nlarge samples, the statistical uncertainty goes to zero, under reasonable\nassumptions.\n\n\n&gt; But nothing\n&gt; infinite is at disposal of an experimentalist. Random generator is\n&gt; pretty good to simulate real events, like a mathematical line is pretty\n&gt; good to simulate real particle trajectory.\n\nWell, EEQT is supposed to be theoretical physics, explaining things\nas they _are_. I agree that one can use number generators to simulate\ntrajectories that look like \'typical\' realizations of your stochastic\nprocesses. But one can use arbitrary sequences of numbers instead of\nsequences generated by random number generators, and one still obtains\nrealizations of your stochastic process, though now untypical,\nless likely ones.\n\n\nThis is why I said that EEQT cannot be the complete answer:\nWhat guarantees in your setting that the \'true\', unique trajectory that\nactually happens is typical rather than atypical? And how typical is it?\n\n\n\n&gt;&gt;&gt;&gt;For a single system you cannot apply probabilities,\n&gt;&gt;&gt;&gt;but you need them in your algorithm.\n&gt;&gt;&gt;\n&gt;&gt;&gt;I need a random number generator. That is all I need.\n&gt;&gt;\n&gt;&gt;But this is already importing ensembles. Any finite sequence of numbers\n&gt;&gt;could have been produced by a number generator; if you only have a single\n&gt;&gt;instance, there is no sure way of telling different sequences apart.\n&gt;\n&gt; You can criticize the same way application of ANY mathematical concept\n&gt; to the real world. We always use models, idealizations and\n&gt; approximations.\n\nNot quite. My criticism would not apply to a Newtonian world and\nmeasurements with worst case errors. While one only obtains approximate\nagreement, one can check whether a prediction is correct, false, or\nborderline.\n\nIn a stochastic setting, _every_ realization of a stochastic process has\nprobability 0; exactly one of them actually happens - - - the certainty\nstatus of a stochastic model for a single history seems comparatively\npoor.\n\n\n\n&gt;&gt;&gt;It is well known\n&gt;&gt;&gt;that chaotic dynamics can produce random sequences practically\n&gt;&gt;&gt;indistinguishable from random ones.\n&gt;&gt;\n&gt;&gt;Once one allows FAPP arguments in the foundations of QM, all problems\n&gt;&gt;are gone. The question is whether there is a way to avoid the FAPP\n&gt;&gt;arguments.\n&gt;\n&gt; There is no way to avoid FAPP arguments.\n\nSuch arguments are not needed in classical physics, including relativity.\nThis has the consequence that in these disciplines there is no such\ncontinuing debate about the foundations - no longer needing FAPP means\nhaving found the foundations.\n\n\n&gt;&gt;&gt;Do you mean that there is no way to\n&gt;&gt;&gt;generate a random number? Everybody does it. Probably you will complain\n&gt;&gt;&gt;about pseudo-random rather than random? Well, pseudo-random exist, and\n&gt;&gt;&gt;chaotic systems exist. I am happy with them.\n&gt;&gt;\n&gt;&gt;They exist only given an underlying deterministic system.\n&gt;&gt;Where is that in EEQT?\n&gt;\n&gt; EEQT is an "event enhanced quantum theory". It does not pretend to be a\n&gt; "theory of everything". Therefore it makes models. Like in\n&gt; electrodynamics, we know that electrons are not point particles, that\n&gt; they have internal structure, but we neglect this structure and take\n&gt; only as much as we really need to answer certain questions. For instance\n&gt; we can even classically model "spin" of the electron (Bargman-Telegdi)\n&gt; without really knowing what is the "real nature of the spin".\n\nOk. So you agree that EEQT is an incomplete theory, even enhanced by\nquantum fields with quarks and leptons, and that its structure needs to\nbe modified on deeper levels?\n\n\n\n&gt; And applying\n&gt; this mechanisms allows us to predict more than the standard quantum\n&gt; theory. Moreover, this mechanism is not in contradiction with\n&gt; observations - as far as I know.\n&gt;\n&gt;&gt;My conjecture is that things in QM need a similar point of view.\n&gt;&gt;Seen from such an angle, there is little fundamental difference\n&gt;&gt;between the Copenhagen interpretation and your EEQT - both need some\n&gt;&gt;classical information and statistical techniques to deduce the most\n&gt;&gt;likely underlying scenario.\n&gt;\n&gt; The difference is in the predictive power: for instance tunneling time,\n&gt; time of arrival etc.\n\nTunneling times can be computed approximately using standard quantum\nmechanics - quantum chemistry of reaction rates is about that.\n\n\n\n&gt;&gt;I really read the paper. You state on p. 12 of quant-ph/9812081\n&gt;&gt;your PDP Algorithm 1, in which the jump probabilities fall from heaven.\n&gt;&gt;You say in the context that it can be proved that averaging this\n&gt;&gt;gives a Lindblad dynamics. But this is deriving Lindblad from your\n&gt;&gt;assumptions, and not the other way around, as you claimed above.\n&gt;\n&gt;\n&gt; Another paper\n&gt;\n&gt; http://xxx.lanl.gov/abs/quant-ph/9512002\n&gt;\n&gt; has the derivation from the Lindblad equation.\n&gt;\n&gt;\n&gt;\n&gt;&gt;I don\'t deny that the formula will work. I only noted that it starts with\n&gt;&gt;machinery that is already complex enough so that it is no surprise\n&gt;&gt;that you can derive the probabilistic interpretation of QM from it.\n&gt;\n&gt;\n&gt; Well, it is a surprise, because there are infinitely many machineries\n&gt; that are complex and that do not lead to any good result!\n&gt;\n&gt; Thanks for your criticism! It is always appreciated as it allows\n&gt; other readers to better understand the issues, and it allows me to\n&gt; better understand weak and strong points of my own theory :-)\n&gt;\n&gt; ark\n&gt;\n&gt; --\n&gt;\n&gt; Arkadiusz Jadczyk\n&gt; http://quantumfuture.net/quantum_future/jadpub.htm\n&gt; --\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>Arkadiusz Jadczyk wrote:
> On 12 Aug 2004 09:30:02 -0400, Arnold Neumaier
> <Arnold.Neumaier@univie.ac.at> wrote:
>
>
>>Hmm. But a stochastic process only makes assertions about large
>>ensembles of identically prepared systems, namely about expectations
>>and probabilities of occurence. Probabilities of single events are
>>meaningless.
>
> No, stochastic process does not make any assertions whatsoever.
> Mathematicians or physicists make assertions about stochastic processes.

Picking on the language is not very constructive. But if you like,
I can be more precise:

''From a stochstic process used to model a system, one can only infer
properties about large ensembles of identically prepared systems.
(And only in the approximation that this ensemble is representative
of the theoretical, infinite ensemble defined by the stochastic model.)


>>A random number generator only simulates a stochastic process
>>(of identically distributed numbers). If you run a binary random number
>>generator once, it just gives you or 1, and not both with a certain
>>probability. To say the 1 occured with probability 1/2 makes only sense
>>if you consider large ensembles...
>
> Large ensembles will not help. They need to be infinite.

Strictly speaking, yes. But in the approximations physicists are
generally working, this amounts to the same. In the limit of arbitrarily
large samples, the statistical uncertainty goes to zero, under reasonable
assumptions.


> But nothing
> infinite is at disposal of an experimentalist. Random generator is
> pretty good to simulate real events, like a mathematical line is pretty
> good to simulate real particle trajectory.

Well, EEQT is supposed to be theoretical physics, explaining things
as they _are_. I agree that one can use number generators to simulate
trajectories that look like 'typical' realizations of your stochastic
processes. But one can use arbitrary sequences of numbers instead of
sequences generated by random number generators, and one still obtains
realizations of your stochastic process, though now untypical,
less likely ones.


This is why I said that EEQT cannot be the complete answer:
What guarantees in your setting that the 'true', unique trajectory that
actually happens is typical rather than atypical? And how typical is it?



>>>>For a single system you cannot apply probabilities,
>>>>but you need them in your algorithm.
>>>
>>>I need a random number generator. That is all I need.
>>
>>But this is already importing ensembles. Any finite sequence of numbers
>>could have been produced by a number generator; if you only have a single
>>instance, there is no sure way of telling different sequences apart.
>
> You can criticize the same way application of ANY mathematical concept
> to the real world. We always use models, idealizations and
> approximations.

Not quite. My criticism would not apply to a Newtonian world and
measurements with worst case errors. While one only obtains approximate
agreement, one can check whether a prediction is correct, false, or
borderline.

In a stochastic setting, _every_ realization of a stochastic process has
probability 0; exactly one of them actually happens - - - the certainty
status of a stochastic model for a single history seems comparatively
poor.



>>>It is well known
>>>that chaotic dynamics can produce random sequences practically
>>>indistinguishable from random ones.
>>
>>Once one allows FAPP arguments in the foundations of QM, all problems
>>are gone. The question is whether there is a way to avoid the FAPP
>>arguments.
>
> There is no way to avoid FAPP arguments.

Such arguments are not needed in classical physics, including relativity.
This has the consequence that in these disciplines there is no such
continuing debate about the foundations - no longer needing FAPP means
having found the foundations.


>>>Do you mean that there is no way to
>>>generate a random number? Everybody does it. Probably you will complain
>>>about pseudo-random rather than random? Well, pseudo-random exist, and
>>>chaotic systems exist. I am happy with them.
>>
>>They exist only given an underlying deterministic system.
>>Where is that in EEQT?
>
> EEQT is an "event enhanced quantum theory". It does not pretend to be a
> "theory of everything". Therefore it makes models. Like in
> electrodynamics, we know that electrons are not point particles, that
> they have internal structure, but we neglect this structure and take
> only as much as we really need to answer certain questions. For instance
> we can even classically model "spin" of the electron (Bargman-Telegdi)
> without really knowing what is the "real nature of the spin".

Ok. So you agree that EEQT is an incomplete theory, even enhanced by
quantum fields with quarks and leptons, and that its structure needs to
be modified on deeper levels?



> And applying
> this mechanisms allows us to predict more than the standard quantum
> theory. Moreover, this mechanism is not in contradiction with
> observations - as far as I know.
>
>>My conjecture is that things in QM need a similar point of view.
>>Seen from such an angle, there is little fundamental difference
>>between the Copenhagen interpretation and your EEQT - both need some
>>classical information and statistical techniques to deduce the most
>>likely underlying scenario.
>
> The difference is in the predictive power: for instance tunneling time,
> time of arrival etc.

Tunneling times can be computed approximately using standard quantum
mechanics - quantum chemistry of reaction rates is about that.



>>I really read the paper. You state on p. 12 of http://www.arxiv.org/abs/quant-ph/9812081
>>your PDP Algorithm 1, in which the jump probabilities fall from heaven.
>>You say in the context that it can be proved that averaging this
>>gives a Lindblad dynamics. But this is deriving Lindblad from your
>>assumptions, and not the other way around, as you claimed above.
>
>
> Another paper
>
> http://xxx.lanl.gov/abs/http://www.arxiv.org/abs/quant-ph/9512002
>
> has the derivation from the Lindblad equation.
>
>
>
>>I don't deny that the formula will work. I only noted that it starts with
>>machinery that is already complex enough so that it is no surprise
>>that you can derive the probabilistic interpretation of QM from it.
>
>
> Well, it is a surprise, because there are infinitely many machineries
> that are complex and that do not lead to any good result!
>
> Thanks for your criticism! It is always appreciated as it allows
> other readers to better understand the issues, and it allows me to
> better understand weak and strong points of my own theory :-)
>
> ark
>
> --
>
> Arkadiusz Jadczyk
> http://quantumfuture.net/quantum_future/jadpub.htm
> --

Nick Maclaren
Aug19-04, 12:40 PM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>In article &lt;4124B703.1090900@univie.ac.at&gt;,\nArnold Neumaier &lt;Arnold.Neumaier@univie.ac.at&gt; writes:\n|&gt;\n|&gt; Picking on the language is not very constructive. But if you like,\n|&gt; I can be more precise:\n|&gt;\n|&gt; \'\'From a stochastic process used to model a system, one can only infer\n|&gt; properties about large ensembles of identically prepared systems.\n|&gt; (And only in the approximation that this ensemble is representative\n|&gt; of the theoretical, infinite ensemble defined by the stochastic model.)\n\nEr, no. If you have a stochastic process consisting of 3 independent\nsteps, each of which has a 1% chance of succeeding, and the process\nsucceeds only if they all do, then the process has a one in a million\nchance of succeeding.\n\nI.e. don\'t bet your shirt on it, not even once and at odds of a\nthousand to one. If you disagree, please bring a large wad of notes,\nand I will set up such a game for you to play :-)\n\n|&gt; &gt; Large ensembles will not help. They need to be infinite.\n|&gt;\n|&gt; Strictly speaking, yes. But in the approximations physicists are\n|&gt; generally working, this amounts to the same. In the limit of arbitrarily\n|&gt; large samples, the statistical uncertainty goes to zero, under reasonable\n|&gt; assumptions.\n\nNot necessarily. There are realistic problems where the law of\nlarge numbers does not apply. Physics is not immune from getting\ncaught by that one.\n\n|&gt; In a stochastic setting, _every_ realization of a stochastic process has\n|&gt; probability 0; exactly one of them actually happens - - - the certainty\n|&gt; status of a stochastic model for a single history seems comparatively\n|&gt; poor.\n\nAgain, that is wrong. It doesn\'t apply to discrete measures, such\nas when the spin of an electron can be either up or down. You can\nhave realistic processes based on discrete measures.\n\n\nRegards,\nNick Maclaren.\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>In article <4124B703.1090900@univie.ac.at>,
Arnold Neumaier <Arnold.Neumaier@univie.ac.at> writes:
|>
|> Picking on the language is not very constructive. But if you like,
|> I can be more precise:
|>
|> ''From a stochastic process used to model a system, one can only infer
|> properties about large ensembles of identically prepared systems.
|> (And only in the approximation that this ensemble is representative
|> of the theoretical, infinite ensemble defined by the stochastic model.)

Er, no. If you have a stochastic process consisting of 3 independent
steps, each of which has a 1% chance of succeeding, and the process
succeeds only if they all do, then the process has a one in a million
chance of succeeding.

I.e. don't bet your shirt on it, not even once and at odds of a
thousand to one. If you disagree, please bring a large wad of notes,
and I will set up such a game for you to play :-)

|> > Large ensembles will not help. They need to be infinite.
|>
|> Strictly speaking, yes. But in the approximations physicists are
|> generally working, this amounts to the same. In the limit of arbitrarily
|> large samples, the statistical uncertainty goes to zero, under reasonable
|> assumptions.

Not necessarily. There are realistic problems where the law of
large numbers does not apply. Physics is not immune from getting
caught by that one.

|> In a stochastic setting, _every_ realization of a stochastic process has
|> probability 0; exactly one of them actually happens - - - the certainty
|> status of a stochastic model for a single history seems comparatively
|> poor.

Again, that is wrong. It doesn't apply to discrete measures, such
as when the spin of an electron can be either up or down. You can
have realistic processes based on discrete measures.


Regards,
Nick Maclaren.

Patrick Powers
Aug24-04, 04:56 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>nmm1@cus.cam.ac.uk (Nick Maclaren) wrote in message news:&lt;cg2lfa\\$isu\\$1@pegasus.csx.cam.ac.uk&gt;...\n &gt; Not necessarily. There are realistic problems where the law of\n&gt; large numbers does not apply. Physics is not immune from getting\n&gt; caught by that one.\n&gt;\n\nI know it is a theoretical possibility for a distribution to have no\nmean (the Lebesque integral is infinite), but do not know real-world\nexamples. Would you please elucidate?\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>nmm1@cus.cam.ac.uk (Nick Maclaren) wrote in message news:<cg2lfa$isu$1@pegasus.csx.cam.ac.uk>...
> Not necessarily. There are realistic problems where the law of
> large numbers does not apply. Physics is not immune from getting
> caught by that one.
>

I know it is a theoretical possibility for a distribution to have no
mean (the Lebesque integral is infinite), but do not know real-world
examples. Would you please elucidate?

Arkadiusz Jadczyk
Aug24-04, 04:56 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>On 19 Aug 2004 10:26:27 -0400, Arnold Neumaier\n&lt;Arnold.Neumaier@univie.ac.at&gt; wrote:\n\n&gt;Picking on the language is not very constructive. But if you like,\n&gt;I can be more precise:\n&gt;\n&gt;\'\'From a stochstic process used to model a system, one can only infer\n&gt;properties about large ensembles of identically prepared systems.\n&gt;(And only in the approximation that this ensemble is representative\n&gt;of the theoretical, infinite ensemble defined by the stochastic model.)\n\nArnold, you will again complain about picking on the language, but what\nyou wrote above makes no sense either. How large an ensemble must be to\nbe "large?". The devil is always in the details. You will not escape it!\n\n\n&gt;&gt;&gt;A random number generator only simulates a stochastic process\n&gt;&gt;&gt;(of identically distributed numbers). If you run a binary random number\n&gt;&gt;&gt;generator once, it just gives you 0 or 1, and not both with a certain\n&gt;&gt;&gt;probability. To say the 1 occured with probability 1/2 makes only sense\n&gt;&gt;&gt;if you consider large ensembles...\n&gt;&gt;\n&gt;&gt; Large ensembles will not help. They need to be infinite.\n&gt;\n&gt;Strictly speaking, yes. But in the approximations physicists are\n&gt;generally working, this amounts to the same. In the limit of arbitrarily\n&gt;large samples, the statistical uncertainty goes to zero, under reasonable\n&gt;assumptions.\n\nArnold, again you are talking about things that make no sense\nwhatsoever. What are "approximations physicists are generally working?"\nPhysicists are working with single atoms! They are working with single\nuniverse! What are "reasonable assumptions?" What does it means "goes to\nzero?" You mean "limit"? What infinite limit has to do with ANY finite\nsample? Don\'t you know that you can skip any finite part of a convergent\nsequence and it will still have the same infinite limit?\n\n\n&gt;&gt; But nothing\n&gt;&gt; infinite is at disposal of an experimentalist. Random generator is\n&gt;&gt; pretty good to simulate real events, like a mathematical line is pretty\n&gt;&gt; good to simulate real particle trajectory.\n&gt;\n&gt;Well, EEQT is supposed to be theoretical physics, explaining things\n&gt;as they _are_. I agree that one can use number generators to simulate\n&gt;trajectories that look like \'typical\' realizations of your stochastic\n&gt;processes. But one can use arbitrary sequences of numbers instead of\n&gt;sequences generated by random number generators, and one still obtains\n&gt;realizations of your stochastic process, though now untypical,\n&gt;less likely ones.\n\nThe same applies to any theory involving probabilities. Are going to get\nrid of probabilities at all? Chase them out of physics, economy,\ngenetics, applied information theory?\n\n&gt;\n&gt;\n&gt;This is why I said that EEQT cannot be the complete answer:\n&gt;What guarantees in your setting that the \'true\', unique trajectory that\n&gt;actually happens is typical rather than atypical? And how typical is it?\n\nI will answer your question with real pleasure, provided you define\nprecisely for me the terms you are using: "typical" vs "atypical"!\n\n\n&gt;&gt;&gt;&gt;&gt;For a single system you cannot apply probabilities,\n&gt;&gt;&gt;&gt;&gt;but you need them in your algorithm.\n&gt;&gt;&gt;&gt;\n&gt;&gt;&gt;&gt;I need a random number generator. That is all I need.\n&gt;&gt;&gt;\n&gt;&gt;&gt;But this is already importing ensembles. Any finite sequence of numbers\n&gt;&gt;&gt;could have been produced by a number generator; if you only have a single\n&gt;&gt;&gt;instance, there is no sure way of telling different sequences apart.\n&gt;&gt;\n&gt;&gt; You can criticize the same way application of ANY mathematical concept\n&gt;&gt; to the real world. We always use models, idealizations and\n&gt;&gt; approximations.\n&gt;\n&gt;Not quite. My criticism would not apply to a Newtonian world and\n&gt;measurements with worst case errors. While one only obtains approximate\n&gt;agreement, one can check whether a prediction is correct, false, or\n&gt;borderline.\n\nAgain you are using terms that have no precise definition, like\n"correct", "borderline" etc. You assume that these are well defined\nnotions, but they are not. You can ignore this fact. Or you can take\ninto account. Like with everything.\n\n&gt;In a stochastic setting, _every_ realization of a stochastic process has\n&gt;probability 0; exactly one of them actually happens - - - the certainty\n&gt;status of a stochastic model for a single history seems comparatively\n&gt;poor.\n\nThere is this magic term: "expectation". It magically adds subjective\nelement to probability. Given a stochastic process, if it is a correct\none, we can compute correct expectations. There is no guarantee that\nexpecting these expectations will be helpful, yet when there is nothing\nbetter than expectations, we do better (as it seems) by expecting\ncorrectly computed expectations rather than incorrectly computed ones.\nWhy is it so is a great mystery, but it is always better, as it seems,\nto base our predictions on knowledge (however incomplete) rather than on\nignorance.\n\nI am proposing a model that can be used to compute expectations, and I\nsuggest that it is a model that simulates REAL events in a real world,\nand that it simulates these events better than other models.\n\nIt allows us (I think) to have an insight into a possible real\nmechanism. Insights are as important as numbers. Because\nwith insight we can find ways of computing new numbers, that we would\nnot even know about without insights.\n\nThus EEQT has a double role: it allows us to compute expectations (and,\nin fact, more expectations than usual QT), and it also allows us to have\ninsights into the possible workings of the Nature. These insights may\nhappen to be wrong - the future will show.\n\n\n&gt;&gt;&gt;&gt;It is well known\n&gt;&gt;&gt;&gt;that chaotic dynamics can produce random sequences practically\n&gt;&gt;&gt;&gt;indistinguishable from random ones.\n&gt;&gt;&gt;\n&gt;&gt;&gt;Once one allows FAPP arguments in the foundations of QM, all problems\n&gt;&gt;&gt;are gone. The question is whether there is a way to avoid the FAPP\n&gt;&gt;&gt;arguments.\n&gt;&gt;\n&gt;&gt; There is no way to avoid FAPP arguments.\n&gt;\n&gt;Such arguments are not needed in classical physics, including relativity.\n&gt;This has the consequence that in these disciplines there is no such\n&gt;continuing debate about the foundations - no longer needing FAPP means\n&gt;having found the foundations.\n\nHere again I disagree. Think of the use of "time" in classical physics.\nYou assume that time "exists" and you model it by a parameter T. But we\nhave no idea what is times, whether it "flows" or whether time that does\nnot yet "exists" can be assumed to "exist". WE have no idea, and we do\nnot want to ask these most important questions, because we think that\nthese questions are not important FAPP!\n\n\n&gt;&gt;&gt;&gt;Do you mean that there is no way to\n&gt;&gt;&gt;&gt;generate a random number? Everybody does it. Probably you will complain\n&gt;&gt;&gt;&gt;about pseudo-random rather than random? Well, pseudo-random exist, and\n&gt;&gt;&gt;&gt;chaotic systems exist. I am happy with them.\n&gt;&gt;&gt;\n&gt;&gt;&gt;They exist only given an underlying deterministic system.\n&gt;&gt;&gt;Where is that in EEQT?\n&gt;&gt;\n&gt;&gt; EEQT is an "event enhanced quantum theory". It does not pretend to be a\n&gt;&gt; "theory of everything". Therefore it makes models. Like in\n&gt;&gt; electrodynamics, we know that electrons are not point particles, that\n&gt;&gt; they have internal structure, but we neglect this structure and take\n&gt;&gt; only as much as we really need to answer certain questions. For instance\n&gt;&gt; we can even classically model "spin" of the electron (Bargman-Telegdi)\n&gt;&gt; without really knowing what is the "real nature of the spin".\n&gt;\n&gt;Ok. So you agree that EEQT is an incomplete theory, even enhanced by\n&gt;quantum fields with quarks and leptons, and that its structure needs to\n&gt;be modified on deeper levels?\n\nOf course it is an incomplete theory! I would say even more: I consider\nit quite possible that there is no complete theory and that there never\nwill be one.\n\n\n&gt;&gt; And applying\n&gt;&gt; this mechanisms allows us to predict more than the standard quantum\n&gt;&gt; theory. Moreover, this mechanism is not in contradiction with\n&gt;&gt; observations - as far as I know.\n&gt;&gt;\n&gt;&gt;&gt;My conjecture is that things in QM need a similar point of view.\n&gt;&gt;&gt;Seen from such an angle, there is little fundamental difference\n&gt;&gt;&gt;between the Copenhagen interpretation and your EEQT - both need some\n&gt;&gt;&gt;classical information and statistical techniques to deduce the most\n&gt;&gt;&gt;likely underlying scenario.\n&gt;&gt;\n&gt;&gt; The difference is in the predictive power: for instance tunneling time,\n&gt;&gt; time of arrival etc.\n&gt;\n&gt;Tunneling times can be computed approximately using standard quantum\n&gt;mechanics - quantum chemistry of reaction rates is about that.\n\nSo, please, compute me time needed for a particle to tunnel through a\npotential barrier, and compute it from first principles! For this, of\ncourse, you must know how to model time in quantum mechanics.\n\nBut before doing so you may like to examine different approaches to\nthe "tunneling times" (Landauer, Bohm, etc. etc.) so that you will be\nable to understand why there is a discussion about this subject, why\nthere are controversies, why there is no one generally accepted\ndefinition.\n\nYou see, the "detection" event can not even be defined within the\nstandard quantum theory. Wigner tried to do it, but his paper has\na mathematical error and is inconclusive. There are theories of\n"continuous monitoring" but they are also based on hidden assumptions.\nEEQT may be wrong and incomplete, but at least the assumptions are made\nclear: 1) a better model is based on an algebra with a nontrivial center\n2) a better model is based on Linblad type evolution\n\nIf you read papers trying to model "quantum measurements" using unitary\nevolution, you will always find that there is some cheating involved,\nsome sweeping the dirt under the rug, so that no one will see it right\naway!\n\nark\n--\n\nArkadiusz Jadczyk\nhttp://quantumfuture.net/quantum_future/jadpub.htm\n--\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>On 19 Aug 2004 10:26:27 -0400, Arnold Neumaier
<Arnold.Neumaier@univie.ac.at> wrote:

>Picking on the language is not very constructive. But if you like,
>I can be more precise:
>
>''From a stochstic process used to model a system, one can only infer
>properties about large ensembles of identically prepared systems.
>(And only in the approximation that this ensemble is representative
>of the theoretical, infinite ensemble defined by the stochastic model.)

Arnold, you will again complain about picking on the language, but what
you wrote above makes no sense either. How large an ensemble must be to
be "large?". The devil is always in the details. You will not escape it!


>>>A random number generator only simulates a stochastic process
>>>(of identically distributed numbers). If you run a binary random number
>>>generator once, it just gives you or 1, and not both with a certain
>>>probability. To say the 1 occured with probability 1/2 makes only sense
>>>if you consider large ensembles...
>>
>> Large ensembles will not help. They need to be infinite.
>
>Strictly speaking, yes. But in the approximations physicists are
>generally working, this amounts to the same. In the limit of arbitrarily
>large samples, the statistical uncertainty goes to zero, under reasonable
>assumptions.

Arnold, again you are talking about things that make no sense
whatsoever. What are "approximations physicists are generally working?"
Physicists are working with single atoms! They are working with single
universe! What are "reasonable assumptions?" What does it means "goes to
zero?" You mean "limit"? What infinite limit has to do with ANY finite
sample? Don't you know that you can skip any finite part of a convergent
sequence and it will still have the same infinite limit?


>> But nothing
>> infinite is at disposal of an experimentalist. Random generator is
>> pretty good to simulate real events, like a mathematical line is pretty
>> good to simulate real particle trajectory.
>
>Well, EEQT is supposed to be theoretical physics, explaining things
>as they _are_. I agree that one can use number generators to simulate
>trajectories that look like 'typical' realizations of your stochastic
>processes. But one can use arbitrary sequences of numbers instead of
>sequences generated by random number generators, and one still obtains
>realizations of your stochastic process, though now untypical,
>less likely ones.

The same applies to any theory involving probabilities. Are going to get
rid of probabilities at all? Chase them out of physics, economy,
genetics, applied information theory?

>
>
>This is why I said that EEQT cannot be the complete answer:
>What guarantees in your setting that the 'true', unique trajectory that
>actually happens is typical rather than atypical? And how typical is it?

I will answer your question with real pleasure, provided you define
precisely for me the terms you are using: "typical" vs "atypical"!


>>>>>For a single system you cannot apply probabilities,
>>>>>but you need them in your algorithm.
>>>>
>>>>I need a random number generator. That is all I need.
>>>
>>>But this is already importing ensembles. Any finite sequence of numbers
>>>could have been produced by a number generator; if you only have a single
>>>instance, there is no sure way of telling different sequences apart.
>>
>> You can criticize the same way application of ANY mathematical concept
>> to the real world. We always use models, idealizations and
>> approximations.
>
>Not quite. My criticism would not apply to a Newtonian world and
>measurements with worst case errors. While one only obtains approximate
>agreement, one can check whether a prediction is correct, false, or
>borderline.

Again you are using terms that have no precise definition, like
"correct", "borderline" etc. You assume that these are well defined
notions, but they are not. You can ignore this fact. Or you can take
into account. Like with everything.

>In a stochastic setting, _every_ realization of a stochastic process has
>probability 0; exactly one of them actually happens - - - the certainty
>status of a stochastic model for a single history seems comparatively
>poor.

There is this magic term: "expectation". It magically adds subjective
element to probability. Given a stochastic process, if it is a correct
one, we can compute correct expectations. There is no guarantee that
expecting these expectations will be helpful, yet when there is nothing
better than expectations, we do better (as it seems) by expecting
correctly computed expectations rather than incorrectly computed ones.
Why is it so is a great mystery, but it is always better, as it seems,
to base our predictions on knowledge (however incomplete) rather than on
ignorance.

I am proposing a model that can be used to compute expectations, and I
suggest that it is a model that simulates REAL events in a real world,
and that it simulates these events better than other models.

It allows us (I think) to have an insight into a possible real
mechanism. Insights are as important as numbers. Because
with insight we can find ways of computing new numbers, that we would
not even know about without insights.

Thus EEQT has a double role: it allows us to compute expectations (and,
in fact, more expectations than usual QT), and it also allows us to have
insights into the possible workings of the Nature. These insights may
happen to be wrong - the future will show.


>>>>It is well known
>>>>that chaotic dynamics can produce random sequences practically
>>>>indistinguishable from random ones.
>>>
>>>Once one allows FAPP arguments in the foundations of QM, all problems
>>>are gone. The question is whether there is a way to avoid the FAPP
>>>arguments.
>>
>> There is no way to avoid FAPP arguments.
>
>Such arguments are not needed in classical physics, including relativity.
>This has the consequence that in these disciplines there is no such
>continuing debate about the foundations - no longer needing FAPP means
>having found the foundations.

Here again I disagree. Think of the use of "time" in classical physics.
You assume that time "exists" and you model it by a parameter T. But we
have no idea what is times, whether it "flows" or whether time that does
not yet "exists" can be assumed to "exist". WE have no idea, and we do
not want to ask these most important questions, because we think that
these questions are not important FAPP!


>>>>Do you mean that there is no way to
>>>>generate a random number? Everybody does it. Probably you will complain
>>>>about pseudo-random rather than random? Well, pseudo-random exist, and
>>>>chaotic systems exist. I am happy with them.
>>>
>>>They exist only given an underlying deterministic system.
>>>Where is that in EEQT?
>>
>> EEQT is an "event enhanced quantum theory". It does not pretend to be a
>> "theory of everything". Therefore it makes models. Like in
>> electrodynamics, we know that electrons are not point particles, that
>> they have internal structure, but we neglect this structure and take
>> only as much as we really need to answer certain questions. For instance
>> we can even classically model "spin" of the electron (Bargman-Telegdi)
>> without really knowing what is the "real nature of the spin".
>
>Ok. So you agree that EEQT is an incomplete theory, even enhanced by
>quantum fields with quarks and leptons, and that its structure needs to
>be modified on deeper levels?

Of course it is an incomplete theory! I would say even more: I consider
it quite possible that there is no complete theory and that there never
will be one.


>> And applying
>> this mechanisms allows us to predict more than the standard quantum
>> theory. Moreover, this mechanism is not in contradiction with
>> observations - as far as I know.
>>
>>>My conjecture is that things in QM need a similar point of view.
>>>Seen from such an angle, there is little fundamental difference
>>>between the Copenhagen interpretation and your EEQT - both need some
>>>classical information and statistical techniques to deduce the most
>>>likely underlying scenario.
>>
>> The difference is in the predictive power: for instance tunneling time,
>> time of arrival etc.
>
>Tunneling times can be computed approximately using standard quantum
>mechanics - quantum chemistry of reaction rates is about that.

So, please, compute me time needed for a particle to tunnel through a
potential barrier, and compute it from first principles! For this, of
course, you must know how to model time in quantum mechanics.

But before doing so you may like to examine different approaches to
the "tunneling times" (Landauer, Bohm, etc. etc.) so that you will be
able to understand why there is a discussion about this subject, why
there are controversies, why there is no one generally accepted
definition.

You see, the "detection" event can not even be defined within the
standard quantum theory. Wigner tried to do it, but his paper has
a mathematical error and is inconclusive. There are theories of
"continuous monitoring" but they are also based on hidden assumptions.
EEQT may be wrong and incomplete, but at least the assumptions are made
clear: 1) a better model is based on an algebra with a nontrivial center
2) a better model is based on Linblad type evolution

If you read papers trying to model "quantum measurements" using unitary
evolution, you will always find that there is some cheating involved,
some sweeping the dirt under the rug, so that no one will see it right
away!

ark
--

Arkadiusz Jadczyk
http://quantumfuture.net/quantum_future/jadpub.htm
--

Ralph Hartley
Aug24-04, 10:03 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\nPatrick Powers wrote:\n\n&gt; I know it is a theoretical possibility for a distribution to have no\n&gt; mean (the Lebesque integral is infinite), but do not know real-world\n&gt; examples. Would you please elucidate?\n\nA simple example is the Cauchy distribution:\n\nP(y&lt;x) = 1/2 + tan^{-1}(x)/pi\n\nIts density is\n\nd(x) = 1/(pi*(1+x^2))\n\nIf you look at a graph of the density, you will see a "bell shaped curve"\nthat is visually hard to distinguish from a normal distribution, but its\nproperties are *very* different.\n\nYou can\'t estimate the mean by averaging many trials. In fact, the average\nof two trials have exactly the same distribution as a single trial (unlike\nthe normal distribution where the variance is half as big).\n\nIt comes up in a few places, for instance as the distribution of the\nquotient of two normally distributed random variables, or as the\ndistribution of the tangent of a uniform distribution over (-pi/2,pi/2).\n\nIt is also identical to the n=1 case of Student\'s t distribution.\n\nIt is a member of a family of "stable distributions", along with the normal\ndistribution. Many of the properties that make the normal distribution\ninteresting are consequences of being a stable distribution, the only one\nwith finite variance.\n\nRalph Hartley\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>Patrick Powers wrote:

> I know it is a theoretical possibility for a distribution to have no
> mean (the Lebesque integral is infinite), but do not know real-world
> examples. Would you please elucidate?

A simple example is the Cauchy distribution:

P(y<x) = 1/2 + tan^{-1}(x)/\pi

Its density is

d(x) = 1/(\pi*(1+x^2))

If you look at a graph of the density, you will see a "bell shaped curve"
that is visually hard to distinguish from a normal distribution, but its
properties are *very* different.

You can't estimate the mean by averaging many trials. In fact, the average
of two trials have exactly the same distribution as a single trial (unlike
the normal distribution where the variance is half as big).

It comes up in a few places, for instance as the distribution of the
quotient of two normally distributed random variables, or as the
distribution of the tangent of a uniform distribution over (-\pi/2,\pi/2).

It is also identical to the n=1 case of Student's t distribution.

It is a member of a family of "stable distributions", along with the normal
distribution. Many of the properties that make the normal distribution
interesting are consequences of being a stable distribution, the only one
with finite variance.

Ralph Hartley

alistair
Aug24-04, 11:30 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>\n\nArkadiusz Jadczyk wrote:\n\nrecommended reference\n&gt; http://quantumfuture.net/quantum_fu...ruc/petruc.html\n\nAlistair says:\n\nYour reference says that David Bohm\'s alternative to standard\nquantum mechanics has failed to describe reality because\nit cannot be applied to relativistic QED or QCD.\nThis may change in the future.The problem\nBohm\'s theory has is that standard QM has been so successful\nand verified by experiment so many times that few physicists\nwill feel motivated to challenge it, and also\nBohm\'s theory does not make predictions that are at odds with\nQM and therefore would allow a clear distinction\nbetween the standard QM and Bohm\'s pilot wave theory.\nIn Bohm\'s theory there is even an element of instantaneous action\nin the way the pilot wave can change instantaneously throughout\nits length.Bohm\'s theory stays close to standard QM in so many\nways, that it would be surprising if it cannot be applied to\nrelativistic QED and QCD.In forty years since it was thought\nup, nobody has been able to produce a convincing argument\nwhich shows the pilot wave theory is wrong.\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>Arkadiusz Jadczyk wrote:

recommended reference
> http://quantumfuture.net/quantum_fu...ruc/petruc.html

Alistair says:

Your reference says that David Bohm's alternative to standard
quantum mechanics has failed to describe reality because
it cannot be applied to relativistic QED or QCD.
This may change in the future.The problem
Bohm's theory has is that standard QM has been so successful
and verified by experiment so many times that few physicists
will feel motivated to challenge it, and also
Bohm's theory does not make predictions that are at odds with
QM and therefore would allow a clear distinction
between the standard QM and Bohm's pilot wave theory.
In Bohm's theory there is even an element of instantaneous action
in the way the pilot wave can change instantaneously throughout
its length.Bohm's theory stays close to standard QM in so many
ways, that it would be surprising if it cannot be applied to
relativistic QED and QCD.In forty years since it was thought
up, nobody has been able to produce a convincing argument
which shows the pilot wave theory is wrong.

Nick Maclaren
Aug25-04, 02:42 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>In article &lt;9511688f.0408210420.8983370@posting.google.com&gt;,\ nfrisbieinstein@yahoo.com (Patrick Powers) writes:\n|&gt; nmm1@cus.cam.ac.uk (Nick Maclaren) wrote in message news:&lt;cg2lfa\\$isu\\$1@pegasus.csx.cam.ac.uk&gt;...\n |&gt;\n|&gt; &gt; Not necessarily. There are realistic problems where the law of\n|&gt; &gt; large numbers does not apply. Physics is not immune from getting\n|&gt; &gt; caught by that one.\n|&gt;\n|&gt; I know it is a theoretical possibility for a distribution to have no\n|&gt; mean (the Lebesque integral is infinite), but do not know real-world\n|&gt; examples. Would you please elucidate?\n\nIt can be both infinite and undefined. For the former, consider\nthe expected time to return to the origin in a random walk on up\nto two dimensions. For the latter, the ratio of two measurements,\nboth of which are Gaussian with a mean of zero (i.e. the Cauchy\ndistribution). Both are fairly common in most sciences.\n\nBut that is a much weaker condition that the actual law of large\nnumbers failing. That can arise when you are working with\nexperiments that are almost, but not quite, independent. It is\nfairly common for the dependence to be negligible when you are\nconsidering a small number of events, but a serious problem when\nyou are considering a large one.\n\nA classic example of the latter is interactions with (say) atoms\nin a lattice, where two atoms a long way apart can be regarded as\nindependent, but you cannot always model the lattice as if all\natoms were independent. My recollection of the exact problems is\na bit rusty :-)\n\n\nRegards,\nNick Maclaren.\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>In article <9511688f.0408210420.8983370@posting.google.com>,
frisbieinstein@yahoo.com (Patrick Powers) writes:
|> nmm1@cus.cam.ac.uk (Nick Maclaren) wrote in message news:<cg2lfa$isu$1@pegasus.csx.cam.ac.uk>...
|>
|> > Not necessarily. There are realistic problems where the law of
|> > large numbers does not apply. Physics is not immune from getting
|> > caught by that one.
|>
|> I know it is a theoretical possibility for a distribution to have no
|> mean (the Lebesque integral is infinite), but do not know real-world
|> examples. Would you please elucidate?

It can be both infinite and undefined. For the former, consider
the expected time to return to the origin in a random walk on up
to two dimensions. For the latter, the ratio of two measurements,
both of which are Gaussian with a mean of zero (i.e. the Cauchy
distribution). Both are fairly common in most sciences.

But that is a much weaker condition that the actual law of large
numbers failing. That can arise when you are working with
experiments that are almost, but not quite, independent. It is
fairly common for the dependence to be negligible when you are
considering a small number of events, but a serious problem when
you are considering a large one.

A classic example of the latter is interactions with (say) atoms
in a lattice, where two atoms a long way apart can be regarded as
independent, but you cannot always model the lattice as if all
atoms were independent. My recollection of the exact problems is
a bit rusty :-)


Regards,
Nick Maclaren.

Joe Rongen
Aug25-04, 02:45 AM
<jabberwocky><div class="vbmenu_control"><a href="jabberwocky:;" onClick="newWindow=window.open('','usenetCode','toolbar=no, location=no,scrollbars=yes,resizable=yes,status=no ,width=650,height=400'); newWindow.document.write('<HTML><HEAD><TITLE>Usenet ASCII</TITLE></HEAD><BODY topmargin=0 leftmargin=0 BGCOLOR=#F1F1F1><table border=0 width=625><td bgcolor=midnightblue><font color=#F1F1F1>This Usenet message\'s original ASCII form: </font></td></tr><tr><td width=449><br><br><font face=courier><UL><PRE>"alistair" &lt;alistair@goforit64.fsnet.co.uk&gt; wrote in message\nnews:861c1b21.0408240820.1d53dcea@posting .google.com...\n\n[snip]\n\n&gt; In forty years since it was thought\n&gt; up, nobody has been able to produce a convincing argument\n&gt; which shows the pilot wave theory is wrong.\n\nA more recent (modified pilot wave) version was given in 1987\nby: Henry Krips in "The MetaPhysics of Quantum Theory"\nOxford University Press, ISBN: 0-19-824971-3.\n\n\n---\nOutgoing mail is certified Virus Free.\nChecked by AVG anti-virus system (http://www.grisoft.com).\nVersion: 6.0.742 / Virus Database: 495 - Release Date: 8/19/04\n\n</UL></PRE></font></td></tr></table></BODY><HTML>');"> <IMG SRC=/images/buttons/ip.gif BORDER=0 ALIGN=CENTER ALT="View this Usenet post in original ASCII form">&nbsp;&nbsp;View this Usenet post in original ASCII form </a></div><P></jabberwocky>"alistair" <alistair@goforit64.fsnet.co.uk> wrote in message
news:861c1b21.0408240820.1d53dcea@posting.google.c om...

[snip]

> In forty years since it was thought
> up, nobody has been able to produce a convincing argument
> which shows the pilot wave theory is wrong.

A more recent (modified pilot wave) version was given in 1987
by: Henry Krips in "The MetaPhysics of Quantum Theory"
Oxford University Press, ISBN: 0-19-824971-3.


---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6..742 / Virus Database: 495 - Release Date: 8/19/04