Re: HLA v1.68 is now available

From: Alex McDonald (alex_mcd_at_btopenworld.com)
Date: 07/28/04 

Date: Wed, 28 Jul 2004 10:09:09 +0000 (UTC)

"Betov" <betov@free.fr> wrote in message
news:XnF953470DB9AF40betovfreefr@212.27.42.73...
> "Randall Hyde" <randyhyde@earthlink.net> écrivait
> news:qMBNc.529$9Y6.141@newsread1.news.pas.earthlink.net:
>
> > "Alex McDonald" <alex_mcd@btopenworld.com> wrote in message
> > news:ce6jj8
> >>
> >> Randy has indicated (another part of this thread) that this is an
> >> NP-complete problem; I'm not in agreement with him here, as I think
> >> it's a cost-based variation of transitive closure, where each basic
> >> block is a
> > node
> >> on the graph and the cost is the jump distance. The minimal algorithm
> >> is P-complete and requires one pass; however, it's a second pass over
> >> the data -- hence two passes needed for your assembler. I'm willing
> >> to be
> > proved
> >> wrong on this one, btw.
> >
> > Alex, this is a very *old* proof. 70's or 80's as I recall.
> > You might want to read the following, as it provides a pretty good
> > explanation of this:
> > http://www.masmforum.com/viewtopic.php?t=1734
>
> :))
>
> Typical Master Pdf Post, isn't it:
>
> * No end BlaBla.
> * Well known pre-built ideas.
> * Zero thinking about the problem.
> * Zero innovation.
> * Patronizing pedantic scolastic tone.

Please, provide your analysis for me to digest. You're attacking the
messenger, not the message.

>
> The most amaizing things, in that Thread, is when we
> have all of those ass-holes admirative when reading
> these flat stupidities.
>
> _YES_, Master Pdf, the Jumps Sizes Optimizations can
> be done easily without Multi-Passes, at very low cost,
> as well for writting the Routine doing so, as at a
> Compile time point of view.

Can I see the evidence of this? Randy's argument at
http://www.masmforum.com/viewtopic.php?t=1734 is pretty comprehensive. Can
you refute any of the points he makes?

>
> It just require that you would understand something
> at Assembly, at Assembly Programming, at Assembly
> thinking and at Assembly Strategy Optimization. Of
> course, not something you will ever be able to do.
>
> As for knowing how to do this, exactely, for you,
> this will be difficult, because i will not publish
> the Method. It will be inside RosAsm Source, and,
> as, for you RosAsm always hang, it will be made
> impossible to find it out and to read it. Too Bad. :)

Ah, proof by obfuscation. Neat.

>
> And, to close with this, mind you, what you are so
> proud to explain in your patronizing pedantic scolastic
> no end BlaBla, i could explain it in less than 10
> very simple to understand lines, for how to it, very
> simply, without Multi-Passes... and guess what? This
> is so simple that it would impress... nobody... and
> that it would be quite easy to say, again, that i
> invented nothing... :))
>

I'm reminded of Fermat's last theorem; "I have discovered a truly remarkable
proof which this margin is too small to contain." Fermat probably knew his
proof was wrong; he never mentioned it again. Something you may like to
consider doing. Alternatively, publish your idea. Your 10 lines should fit
nicely in this margin here; 

-- 
Regards
Alex McDonald

Relevant Pages

  • Re: HLA v1.68 is now available
    ... Zero thinking about the problem. ... _YES_, Master Pdf, the Jumps Sizes Optimizations can ... be done easily without Multi-Passes, at very low cost, ... It will be inside RosAsm Source, and, ...
    (alt.lang.asm)
  • Re: HLA v1.68 is now available
    ... > be done easily without Multi-Passes, at very low cost, ... It will be inside RosAsm Source, and, ...
    (alt.lang.asm)