I wrote:
And when they say the performance is "variable", I think they're talking
about some measure of performance during a single execution of a given
program, not about repeating the execution of the same program multiple
times and finding variations from one run to another.
Looks like I
On Mon, Jul 11, 2005 at 05:27:33PM -0400, Jesse Mazer wrote:
> I don't know what compiler optimization flags are, but if the trajectories
Compiler optimization flags tell the compiler to optimize generated code more
aggressively, which may even break your code, at a high optimization setting.
An
Norman Samish writes:
http://arxiv.org/abs/nlin.AO/0506030 shows the following abstract,
suggesting that complex computations are not precisely repeatable. Doesn't
Bruno's Computation Hypothesis imply that computations ARE precisely
repeatable?
"Modern computer microprocessors are composed of
Eugen Leitl wrote:
On Mon, Jul 11, 2005 at 04:45:21PM -0400, Jesse Mazer wrote:
> I don't think that paper is talking about computations being
> nonrepeatable--they say that they're not talking about "stochastic
> variations" (which I think refers to genuine physical sources of
> randomness), b
On Mon, Jul 11, 2005 at 04:45:21PM -0400, Jesse Mazer wrote:
> I don't think that paper is talking about computations being
> nonrepeatable--they say that they're not talking about "stochastic
> variations" (which I think refers to genuine physical sources of
> randomness), but instead about so
Norman Samish wrote:
http://arxiv.org/abs/nlin.AO/0506030 shows the following abstract,
suggesting that complex computations are not precisely repeatable. Doesn't
Bruno's Computation Hypothesis imply that computations ARE precisely
repeatable?
"Modern computer microprocessors are composed of
6 matches
Mail list logo
