• Re: Hugh Aguilar - TESTRA - What really happened there?

    From Jurgen Pitaske@21:1/5 to Jurgen Pitaske on Sun Apr 30 00:22:14 2023
    On Sunday, 30 April 2023 at 08:18:56 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 12 December 2021 at 08:56:54 UTC, Jurgen Pitaske wrote:
    On Saturday, 11 December 2021 at 19:28:52 UTC, Hugh Aguilar wrote:
    On Friday, July 23, 2021 at 1:43:39 AM UTC-7, johnro...@gmail.com wrote:
    His brother worked for us after he left on the HPGL converter, not Hugh. When he complained about it,
    I explained that Tom was confused about that, and thought that would be the end of it.

    Tom Hart, here impersonating his brother John, is attacking my brother who was not
    involved in any of this. Tom Hart is also lying when he says that this was explained to me
    during my visit two years ago --- this implausible story is a recent fabrication.

    Tom Hart's best friend, Juergen Pintaske, advocates physically attacking the family members of one's perceived enemies:

    On Friday, December 10, 2021 at 4:59:04 AM UTC-7, jpit...@gmail.com wrote:
    But people are now allowed via systems like here to dump as much shit as they like

    It should be ok as well then
    to "physically" dump as much of the shit they supplied here physically on them as well.
    Which would give some satisfaction - and at least be a stink.
    It could be dumped as well on their wives or children. Or other relatives, why not.
    It would show some responsibility.

    For the rest of us who behave like a part of a community

    Nobody wants to be a member of Tom Hart's community! Tom Hart and Juergen Pintaske
    deserve each other --- they can be a community of two.
    Typical HUGH AGUILAR BULLSHIT.

    I would not dare to call either of them friends, We do not know each other well enough.
    We had very few few discussions on the phone and email exchanges ove the last 6 years.

    As of ALL OF THE SHIT that Hugh produces,
    I found it fair to start this thread and ask Testra for a statement.
    When this was kindly sent by Testra, everybody stared to be a lier.

    All documented in this thread. Or read it as PDF.

    As everyboy is a lier for Hugh,
    by definition ( everybody) he is included as a lier.
    Probably one with the highest level of performance.
    In another thread this one her was used as basis.
    This made me look again here after a long time.

    This Thread I started 4 years ago.

    And now we have achieved a special,
    and I unfortunately missed the moment to take a screen print at 4444:
    It is 4445 now -
    You cannot get closer to fours.
    Have a nice day,
    and May The Fours Be With You.

    UUUUPS - typo and before my first coffee ...
    We are at 4405 - but will be there at 4444 soon anyway ...

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jurgen Pitaske@21:1/5 to Jurgen Pitaske on Sun Apr 30 00:18:55 2023
    On Sunday, 12 December 2021 at 08:56:54 UTC, Jurgen Pitaske wrote:
    On Saturday, 11 December 2021 at 19:28:52 UTC, Hugh Aguilar wrote:
    On Friday, July 23, 2021 at 1:43:39 AM UTC-7, johnro...@gmail.com wrote:
    His brother worked for us after he left on the HPGL converter, not Hugh. When he complained about it,
    I explained that Tom was confused about that, and thought that would be the end of it.

    Tom Hart, here impersonating his brother John, is attacking my brother who was not
    involved in any of this. Tom Hart is also lying when he says that this was explained to me
    during my visit two years ago --- this implausible story is a recent fabrication.

    Tom Hart's best friend, Juergen Pintaske, advocates physically attacking the family members of one's perceived enemies:

    On Friday, December 10, 2021 at 4:59:04 AM UTC-7, jpit...@gmail.com wrote:
    But people are now allowed via systems like here to dump as much shit as they like

    It should be ok as well then
    to "physically" dump as much of the shit they supplied here physically on them as well.
    Which would give some satisfaction - and at least be a stink.
    It could be dumped as well on their wives or children. Or other relatives, why not.
    It would show some responsibility.

    For the rest of us who behave like a part of a community

    Nobody wants to be a member of Tom Hart's community! Tom Hart and Juergen Pintaske
    deserve each other --- they can be a community of two.
    Typical HUGH AGUILAR BULLSHIT.

    I would not dare to call either of them friends, We do not know each other well enough.
    We had very few few discussions on the phone and email exchanges ove the last 6 years.

    As of ALL OF THE SHIT that Hugh produces,
    I found it fair to start this thread and ask Testra for a statement.
    When this was kindly sent by Testra, everybody stared to be a lier.

    All documented in this thread. Or read it as PDF.

    As everyboy is a lier for Hugh,
    by definition ( everybody) he is included as a lier.
    Probably one with the highest level of performance.

    In another thread this one her was used as basis.
    This made me look again here after a long time.

    This Thread I started 4 years ago.

    And now we have achieved a special,
    and I unfortunately missed the moment to take a screen print at 4444:
    It is 4445 now -
    You cannot get closer to fours.
    Have a nice day,
    and May The Fours Be With You.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jurgen Pitaske@21:1/5 to Jurgen Pitaske on Sun Apr 30 01:29:11 2023
    On Sunday, 30 April 2023 at 08:22:16 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 30 April 2023 at 08:18:56 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 12 December 2021 at 08:56:54 UTC, Jurgen Pitaske wrote:
    On Saturday, 11 December 2021 at 19:28:52 UTC, Hugh Aguilar wrote:
    On Friday, July 23, 2021 at 1:43:39 AM UTC-7, johnro...@gmail.com wrote:
    His brother worked for us after he left on the HPGL converter, not Hugh. When he complained about it,
    I explained that Tom was confused about that, and thought that would be the end of it.

    Tom Hart, here impersonating his brother John, is attacking my brother who was not
    involved in any of this. Tom Hart is also lying when he says that this was explained to me
    during my visit two years ago --- this implausible story is a recent fabrication.

    Tom Hart's best friend, Juergen Pintaske, advocates physically attacking
    the family members of one's perceived enemies:

    On Friday, December 10, 2021 at 4:59:04 AM UTC-7, jpit...@gmail.com wrote:
    But people are now allowed via systems like here to dump as much shit as they like

    It should be ok as well then
    to "physically" dump as much of the shit they supplied here physically on them as well.
    Which would give some satisfaction - and at least be a stink.
    It could be dumped as well on their wives or children. Or other relatives, why not.
    It would show some responsibility.

    For the rest of us who behave like a part of a community

    Nobody wants to be a member of Tom Hart's community! Tom Hart and Juergen Pintaske
    deserve each other --- they can be a community of two.
    Typical HUGH AGUILAR BULLSHIT.

    I would not dare to call either of them friends, We do not know each other well enough.
    We had very few few discussions on the phone and email exchanges ove the last 6 years.

    As of ALL OF THE SHIT that Hugh produces,
    I found it fair to start this thread and ask Testra for a statement.
    When this was kindly sent by Testra, everybody stared to be a lier.

    All documented in this thread. Or read it as PDF.

    As everyboy is a lier for Hugh,
    by definition ( everybody) he is included as a lier.
    Probably one with the highest level of performance.
    In another thread this one her was used as basis.
    This made me look again here after a long time.

    This Thread I started 4 years ago.

    And now we have achieved a special,
    and I unfortunately missed the moment to take a screen print at 4444:
    It is 4445 now -
    You cannot get closer to fours.
    Have a nice day,
    and May The Fours Be With You.
    UUUUPS - typo and before my first coffee ...
    We are at 4405 - but will be there at 4444 soon anyway ...

    We are getting close to 4444, as it is 4424 now, great

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jurgen Pitaske@21:1/5 to Jurgen Pitaske on Sun Apr 30 02:30:37 2023
    On Sunday, 30 April 2023 at 09:29:12 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 30 April 2023 at 08:22:16 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 30 April 2023 at 08:18:56 UTC+1, Jurgen Pitaske wrote:
    On Sunday, 12 December 2021 at 08:56:54 UTC, Jurgen Pitaske wrote:
    On Saturday, 11 December 2021 at 19:28:52 UTC, Hugh Aguilar wrote:
    On Friday, July 23, 2021 at 1:43:39 AM UTC-7, johnro...@gmail.com wrote:
    His brother worked for us after he left on the HPGL converter, not Hugh. When he complained about it,
    I explained that Tom was confused about that, and thought that would be the end of it.

    Tom Hart, here impersonating his brother John, is attacking my brother who was not
    involved in any of this. Tom Hart is also lying when he says that this was explained to me
    during my visit two years ago --- this implausible story is a recent fabrication.

    Tom Hart's best friend, Juergen Pintaske, advocates physically attacking
    the family members of one's perceived enemies:

    On Friday, December 10, 2021 at 4:59:04 AM UTC-7, jpit...@gmail.com wrote:
    But people are now allowed via systems like here to dump as much shit as they like

    It should be ok as well then
    to "physically" dump as much of the shit they supplied here physically on them as well.
    Which would give some satisfaction - and at least be a stink.
    It could be dumped as well on their wives or children. Or other relatives, why not.
    It would show some responsibility.

    For the rest of us who behave like a part of a community

    Nobody wants to be a member of Tom Hart's community! Tom Hart and Juergen Pintaske
    deserve each other --- they can be a community of two.
    Typical HUGH AGUILAR BULLSHIT.

    I would not dare to call either of them friends, We do not know each other well enough.
    We had very few few discussions on the phone and email exchanges ove the last 6 years.

    As of ALL OF THE SHIT that Hugh produces,
    I found it fair to start this thread and ask Testra for a statement. When this was kindly sent by Testra, everybody stared to be a lier.

    All documented in this thread. Or read it as PDF.

    As everyboy is a lier for Hugh,
    by definition ( everybody) he is included as a lier.
    Probably one with the highest level of performance.
    In another thread this one her was used as basis.
    This made me look again here after a long time.

    This Thread I started 4 years ago.

    And now we have achieved a special,
    and I unfortunately missed the moment to take a screen print at 4444:
    It is 4445 now -
    You cannot get closer to fours.
    Have a nice day,
    and May The Fours Be With You.
    UUUUPS - typo and before my first coffee ...
    We are at 4405 - but will be there at 4444 soon anyway ...
    We are getting close to 4444, as it is 4424 now, great

    There seems to be some activity here.

    We made the 4444 views,
    still in the 4th month of this year.

    May the Fours be with you.
    And next soon
    May the Forth Be With You

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to John Hart on Sun Sep 24 18:01:56 2023
    On Tuesday, November 9, 2021 at 11:32:00 PM UTC-7, John Hart wrote:
    On Tuesday, November 9, 2021 at 1:55:46 PM UTC-7, Ilya Tarasov wrote:
    How many Forth CPUs do you plan to design? How many do you need?
    This will be the last one. ...
    Our present 16bit system has a USB interface, a local network,
    a port for wireless, a serial port for
    miscellaneous I/O, two pwm outputs, four encoder inputs, and outputs
    to control four axis of motion.

    The 32bit processor will enable us to increase the number of axis to 16, make the program space
    60 times bigger, and execute code ten times faster, without changing the hardware.

    About a month ago I received an email that said this: ------------------------------------------------------------------
    From my experience on using the ispLSI, I doubt that the isp1048
    can implement any kind of CPU.
    I guess that the MiniForth is running on i8032 CPU. Am I right? ------------------------------------------------------------------

    This is a common belief, that it is impossible to implement a processor
    on the Lattice isp1048 PLD. Typically this assertion is followed by
    the unbeliever explaining that he tried to do so, but that turkey didn't fly. Having a job interviewer believe that I'm telling a tall tale means that
    I won't get the job!

    I think that Tom Hart and John Hart were fools to refuse to admit
    that I wrote MFX for the MiniForth, saying that I am lying about this
    and that I was never anything more than a maintenance programmer for
    MFX that was written by John Hart and Steve Brault before I showed up.

    When people say that the MiniForth was impossible due to the
    Lattice isp1048 PLD being too limited to support a processor,
    there are only two witnesses to the development of the MiniForth
    who can attest that the MiniForth was successfully built.
    These two witnesses are myself and Steve Brault.
    When Testra accuses me of lying about writing MFX, Testra undermines
    my credibility in attesting that the MiniForth was successfully built.
    This leaves only Steve Brault to attest to the existence of the MiniForth.

    Steve Brault seems to be quite absent in this thread attacking me.
    If he were a loyal Testra employee he would have joined in on Tom Hart's
    attack on me, to prove his loyalty to Tom Hart (and keep his job).
    He hasn't done so. This presumably means that he quit Testra sometime
    after I quit Testra, likely for the same reason (low pay, although he was likely making two or three times what I made). This means that there are
    no witnesses remaining to attest that the MiniForth actually existed.
    This is why people feel comfortable in saying that the MiniForth
    was not a processor but was just an i8032 program --- there is nobody
    to contradict this accusation that the MiniForth is a tall tale.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jurgen Pitaske@21:1/5 to Hugh Aguilar on Sun Sep 24 23:52:55 2023
    On Monday, 25 September 2023 at 02:01:59 UTC+1, Hugh Aguilar wrote:
    On Tuesday, November 9, 2021 at 11:32:00 PM UTC-7, John Hart wrote:
    On Tuesday, November 9, 2021 at 1:55:46 PM UTC-7, Ilya Tarasov wrote:
    How many Forth CPUs do you plan to design? How many do you need?
    This will be the last one. ...
    Our present 16bit system has a USB interface, a local network,
    a port for wireless, a serial port for
    miscellaneous I/O, two pwm outputs, four encoder inputs, and outputs
    to control four axis of motion.

    The 32bit processor will enable us to increase the number of axis to 16, make the program space
    60 times bigger, and execute code ten times faster, without changing the hardware.
    About a month ago I received an email that said this: ------------------------------------------------------------------
    From my experience on using the ispLSI, I doubt that the isp1048
    can implement any kind of CPU.
    I guess that the MiniForth is running on i8032 CPU. Am I right? ------------------------------------------------------------------

    This is a common belief, that it is impossible to implement a processor
    on the Lattice isp1048 PLD. Typically this assertion is followed by
    the unbeliever explaining that he tried to do so, but that turkey didn't fly.
    Having a job interviewer believe that I'm telling a tall tale means that
    I won't get the job!

    I think that Tom Hart and John Hart were fools to refuse to admit
    that I wrote MFX for the MiniForth, saying that I am lying about this
    and that I was never anything more than a maintenance programmer for
    MFX that was written by John Hart and Steve Brault before I showed up.

    When people say that the MiniForth was impossible due to the
    Lattice isp1048 PLD being too limited to support a processor,
    there are only two witnesses to the development of the MiniForth
    who can attest that the MiniForth was successfully built.
    These two witnesses are myself and Steve Brault.
    When Testra accuses me of lying about writing MFX, Testra undermines
    my credibility in attesting that the MiniForth was successfully built.
    This leaves only Steve Brault to attest to the existence of the MiniForth.

    Steve Brault seems to be quite absent in this thread attacking me.
    If he were a loyal Testra employee he would have joined in on Tom Hart's attack on me, to prove his loyalty to Tom Hart (and keep his job).
    He hasn't done so. This presumably means that he quit Testra sometime
    after I quit Testra, likely for the same reason (low pay, although he was likely making two or three times what I made). This means that there are
    no witnesses remaining to attest that the MiniForth actually existed.
    This is why people feel comfortable in saying that the MiniForth
    was not a processor but was just an i8032 program --- there is nobody
    to contradict this accusation that the MiniForth is a tall tale.


    It is all in the thread I started at the time to clarify what happened,
    and many people gave their opinion. https://groups.google.com/g/comp.lang.forth/c/wydQr643gX0

    If this went through to production, many many customers would own it now.

    Please dump your shit elsewhere.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Rod Pemberton on Mon Sep 25 03:37:18 2023
    On Wednesday, June 16, 2021 at 8:27:07 PM UTC+2, Rod Pemberton wrote:
    In other words, Hugh must always see himself as the "King of the Hill",
    as royalty, as perfect, and in total control, in regards to all things Forth. All conflict with Hugh shall be repressed, suppressed, and
    oppressed, for Hugh is the King! All hail mighty Hugh!
    That's true. I can remember a discussion where it was something about "experts". https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ

    The point that makes him *really* mad is that I neither care about labels nor value being the "biggest ape on the hill". The only metric I find useful is what I
    can do with what I got upstairs.

    Since he is wired completely differently (he is actually *begging* for validation)
    it intensely irritates him when somebody is not racing him or giving him kudos for work he finds extremely important and valuable.

    It is what it is.. What I do value Hugh for is that he's actually written Forth code -
    so that alone IMHO justifies him being here - contrary to some others my lawyer told me not to engage with when it can be avoided.

    c.l.f has been not the most pleasant group on Usenet for years (actually, we're the laughing stock of comp.lang.* since we talk a *lot* about our technology without actually using it), but I've gotten used to all the infighting.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From OrangeFish9737@21:1/5 to Jurgen Pitaske on Mon Sep 25 10:26:21 2023
    On 2023-09-25 02:52, Jurgen Pitaske wrote (in part):

    It is all in the thread I started at the time to clarify what happened,
    and many people gave their opinion. https://groups.google.com/g/comp.lang.forth/c/wydQr643gX0

    Or https://comp.lang.forth.narkive.com/Yhv91mKD/hugh-aguilar-testra-what-really-happened-there
    for those who do not use Google Groups.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hans Bezemer on Tue Sep 26 13:41:50 2023
    On 25/09/2023 8:37 pm, Hans Bezemer wrote:

    c.l.f has been not the most pleasant group on Usenet for years (actually, we're
    the laughing stock of comp.lang.* since we talk a *lot* about our technology without actually using it), but I've gotten used to all the infighting.

    Here's a thread from 30 years ago. Chastising c.l.f. seems to have been
    as popular then as now :)

    https://groups.google.com/g/comp.lang.forth/c/HD-MCTas1Nc/m/cEP8stnQLfAJ

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to dxf on Tue Sep 26 01:35:56 2023
    On Tuesday, September 26, 2023 at 5:41:52 AM UTC+2, dxf wrote:
    c.l.f has been not the most pleasant group on Usenet for years (actually, we're
    the laughing stock of comp.lang.* since we talk a *lot* about our technology
    without actually using it), but I've gotten used to all the infighting.
    Here's a thread from 30 years ago. Chastising c.l.f. seems to have been
    as popular then as now :)

    Well, it is true, isn't it. Some of the longest threads here have everything to do with
    bashing persons or have nothing to do with Forth itself (and yes, in the latter category
    I'm also guilty as charged).

    I rarely see newbies here (Which in a sense is understandable, because Forth has an
    incredibly steep learning curve - so they quit quite quickly). It's rare to see that a newbie
    is taking under the wings of a more senior programmer - gee, I was lucky.

    We're still fighting wars, sometimes on the most basics of facilities - like strings, objects
    or locals.

    You rarely see full application - unless in the rare hardware related department. Source
    code is a big no no at all in general. From time to time I still post code - but I can't say it's
    an enjoyable experience. To give a few examples:

    - A tiny dynamic strings package quickly ended up in a LONG discussion whether COMUS
    words that have been with us for 30 years or more are "general enough for use in code";
    - A little dabbling with ellipse circumference code ended up in a discussion whether FSQRT
    is expensive.

    Now - I don't need a repetition of those discussions here. We've covered that. We've been there.
    But what would be more useful is:

    "Thanks - that might be useful!";
    "If you did it that way, I'd be more compact and even faster.";
    "Here is a LOCALS version. It's even more compact.";
    "There is an even faster algorithm. Here's the link."

    Now, I'm not exclusively posting here. There is much more useful commenting on e.g.
    Rosetta Code. Several times I got extremely smart and useful comment there. People on
    comp.lang.c are very responsive and helpful. That's what makes a forum viable in the long
    run IMHO.

    I also have to defend the few people here that are STILL posting their code and sometimes
    have their guts ripped out undeserved. I have off-clf worked with them and they are very
    nice, helpful and talented people who really try to contribute. I don't know why they're still
    taking all that abuse. And note - I'm a quirky individual who created and maintains a quirky
    compiler and tends to write quirky code. But we seem to get along just fine.

    Do I think c.l.f. will change? No, I think it's in the genes. On the other side, I think it's useful
    to be confronted with your mirror image once in a while.

    Hans

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Kerr-Mudd, John@21:1/5 to Hans Bezemer on Tue Sep 26 10:38:30 2023
    On Tue, 26 Sep 2023 01:35:56 -0700 (PDT)
    Hans Bezemer <the.beez.speaks@gmail.com> wrote:

    On Tuesday, September 26, 2023 at 5:41:52 AM UTC+2, dxf wrote:
    c.l.f has been not the most pleasant group on Usenet for years (actually, we're

    [snip summary of things wrong with this NG]

    Now, I'm not exclusively posting here. There is much more useful commenting on e.g.
    Rosetta Code. Several times I got extremely smart and useful comment there. People on
    comp.lang.c are very responsive and helpful. That's what makes a forum viable in the long
    run IMHO.

    I'm no C programmer, (nor even much of a Forth one) but I've heard of some
    who got a right roasting in clc, back some years ago - seems some compiler writers decided "undefined behaviour" meant they could mess up the
    intentions of a coder with delight.

    []


    Do I think c.l.f. will change? No, I think it's in the genes. On the other side, I think it's useful
    to be confronted with your mirror image once in a while.

    Hans





    --
    Bah, and indeed Humbug.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to Hans Bezemer on Tue Sep 26 09:26:35 2023
    On Monday, September 25, 2023 at 5:37:20 AM UTC-5, Hans Bezemer wrote:
    c.l.f has been not the most pleasant group on Usenet for years (actually, we're
    the laughing stock of comp.lang.* since we talk a *lot* about our technology without actually using it), but I've gotten used to all the infighting.

    This group isn't so bad.
    The first news group, Philosophy, that I visited was nothing
    but pure muck slinging by a core half dozen clowns. They were
    trying to make it into an art form but none were close to an
    Alexander Pope so it wasn't even entertaining.
    (Cortes on return from his conquest took all the loot for
    himself and his small inner circle. His men retaliated by
    painting graffiti on his walls, in verse. These were common
    soldiers.)
    --
    me

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From none) (albert@21:1/5 to John on Wed Sep 27 10:23:51 2023
    In article <20230926103830.cb69a2ff5b91dbc09825bc4f@127.0.0.1>,
    Kerr-Mudd, John <admin@127.0.0.1> wrote:
    <SNIP>
    I'm no C programmer, (nor even much of a Forth one) but I've heard of some >who got a right roasting in clc, back some years ago - seems some compiler >writers decided "undefined behaviour" meant they could mess up the
    intentions of a coder with delight.

    And they are. However the correct interpretation is that if a programmer
    does not make its intentions clear, the compiler builder could go
    out of its way to find that situation out, but they don't.
    A C++ compiler is sufficiently complicated that this is not doable
    anymore. One of the way out is to simply forbid "undefined behaviour",
    meaning that in all circumstances the compiler generates a program
    that behaves the same in all situations.
    Actually this means that *all* compilers force the program to behave
    the same on *all* systems. The industry is not willing to pay the
    price for that.

    Hugh
    --
    Don't praise the day before the evening. One swallow doesn't make spring.
    You must not say "hey" before you have crossed the bridge. Don't sell the
    hide of the bear until you shot it. Better one bird in the hand than ten in
    the air. First gain is a cat spinning. - the Wise from Antrim -

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hans Bezemer on Wed Sep 27 19:00:52 2023
    On 26/09/2023 6:35 pm, Hans Bezemer wrote:
    ...
    I rarely see newbies here (Which in a sense is understandable, because Forth has an
    incredibly steep learning curve - so they quit quite quickly). It's rare to see that a newbie
    is taking under the wings of a more senior programmer - gee, I was lucky.

    I've noted a good amount of newbie activity on retro forums. Everything from sharing info about forth resources to showing off their latest forth programmed gadget. Some hold down day jobs as programmers. If newbies aren't coming to c.l.f. it could be as simple as they don't need us.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to dxf on Wed Sep 27 07:04:12 2023
    On Wednesday, September 27, 2023 at 4:00:57 AM UTC-5, dxf wrote:

    I've noted a good amount of newbie activity on retro forums. Everything from

    If I knew nothing of Forth, didn't know any better and
    stumbled into this group, I would be out of here very
    quickly. Not because of the bickering of silly people, but
    because of the primary subject matter discussed here,
    compliance and nazi coding. However, important it is to
    the professionals and wantabes, it ain't of general
    programming interest and makes Forth look difficult and
    problematic.
    Fig provided a nice small sufficient program to work with
    and published Forth Dimensions that provided code bits,
    ideas and news that fostered interest, very little of which
    means anything to today's group here. So yes, retro is
    a draw back when Forth was fun.
    --
    me

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Kerr-Mudd, John@21:1/5 to S Jack on Wed Sep 27 16:03:18 2023
    On Wed, 27 Sep 2023 07:04:12 -0700 (PDT)
    S Jack <sdwjack69@gmail.com> wrote:

    On Wednesday, September 27, 2023 at 4:00:57 AM UTC-5, dxf wrote:

    I've noted a good amount of newbie activity on retro forums. Everything from

    If I knew nothing of Forth, didn't know any better and
    stumbled into this group, I would be out of here very
    quickly. Not because of the bickering of silly people, but
    because of the primary subject matter discussed here,
    compliance and nazi coding. However, important it is to
    the professionals and wantabes, it ain't of general
    programming interest and makes Forth look difficult and
    problematic.
    Fig provided a nice small sufficient program to work with
    and published Forth Dimensions that provided code bits,
    ideas and news that fostered interest, very little of which
    means anything to today's group here. So yes, retro is
    a draw back when Forth was fun.

    Maybe. To others it looks as if the language is stuck in
    the 80's.

    --
    Bah, and indeed Humbug.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Zbig@21:1/5 to All on Wed Sep 27 09:00:10 2023
    So yes, retro is a draw back when Forth was fun.

    https://www.youtube.com/watch?v=qUbxFeqRZwI

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Zbig@21:1/5 to All on Wed Sep 27 09:35:30 2023
    So yes, retro is a draw back when Forth was fun.
    https://www.youtube.com/watch?v=qUbxFeqRZwI
    https://youtu.be/8elAi-7G0OE?si=0gHUJ5XoYW75xNZk

    https://www.youtube.com/watch?v=Nb-KkVNEbw8

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to Zbig on Wed Sep 27 09:45:06 2023
    On Wednesday, September 27, 2023 at 11:35:33 AM UTC-5, Zbig wrote:
    So yes, retro is a draw back when Forth was fun.
    https://www.youtube.com/watch?v=qUbxFeqRZwI
    https://youtu.be/8elAi-7G0OE?si=0gHUJ5XoYW75xNZk
    https://www.youtube.com/watch?v=Nb-KkVNEbw8

    Oops, forgot the lyrics:
    "Give me that old fashion Forth
    A program that smoothly flows
    Even when evil state is there
    It carries on without a care"

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to Zbig on Wed Sep 27 09:25:58 2023
    On Wednesday, September 27, 2023 at 11:00:12 AM UTC-5, Zbig wrote:
    So yes, retro is a draw back when Forth was fun.
    https://www.youtube.com/watch?v=qUbxFeqRZwI

    https://youtu.be/8elAi-7G0OE?si=0gHUJ5XoYW75xNZk

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Wed Sep 27 20:32:26 2023
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote:
    On Wednesday, June 16, 2021 at 8:27:07 PM UTC+2, Rod Pemberton wrote:
    In other words, Hugh must always see himself as the "King of the Hill",
    as royalty, as perfect, and in total control, in regards to all things Forth. All conflict with Hugh shall be repressed, suppressed, and oppressed, for Hugh is the King! All hail mighty Hugh!
    That's true. I can remember a discussion where it was something about "experts". https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ

    I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is,
    but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!

    The point that makes him *really* mad is that I neither care about labels nor
    value being the "biggest ape on the hill". The only metric I find useful is what I
    can do with what I got upstairs.

    Hans also has an instructional video teaching the subject of implementing
    a string stack, which he doesn't know how to do. His video provided a graphical illustration of swapping two strings --- one string gets copied
    into a pad somewhere, then the other string gets copied to where it was,
    then the string in the pad gets copied to where that string was.
    That was an hilarious video! Hans doesn't know what COW (copy-on-write)
    is, or know that it is much faster to just swap the pointers to the strings rather than swap the entire strings.
    Hans doesn't have any knowledge "upstairs" --- just a lot of hot air --- what he
    does with what he has upstairs is make hilariously stupid instructional videos.

    Since he is wired completely differently (he is actually *begging* for validation)
    it intensely irritates him when somebody is not racing him or giving him kudos
    for work he finds extremely important and valuable.

    Hans is still not making any sense.
    If I wanted "validation" I would have stayed on the Forth-200x mailing list
    so my super-duper expert status would be validated by the Forth-200x
    committee. Being on the Forth-200x mailing list is essentially the same
    as having reference letters from Stephen Pelc, Anton Ertl, Bernd Paysan,
    Peter Knaggs, etc., that can be used as validation of Forth expertise.
    The whole point of being on the Forth-200x mailing list is so that,
    in the unlikely case that a job in Forth is offered, the candidate can explain that he is not just a mere Forth programmer, but he sets the standard for
    the entire Forth community. All Forth programmers rely on the Forth-200x experts to do their thinking for them! The Forth-200x committee considers
    them to be the elite whose opinion on Forth is valuable. Woo hoo!

    It is what it is.. What I do value Hugh for is that he's actually written Forth code -
    so that alone IMHO justifies him being here

    There was this thread: https://groups.google.com/g/comp.lang.forth/c/hp1MbSkew08/m/os5OYTOeBAAJ
    Hans said:

    On Sunday, February 26, 2023 at 7:37:35 AM UTC-7, Hans Bezemer wrote:
    But maybe now you understand why I don't care about you, Hugh. Or anything you say about me. Or make me stop what I'm doing. To me, you're just a nobody
    with a crazy opinion I don't care for.

    Hans Bezemer

    BTW, I can rip your NOVICE package till the last byte.

    Hans Bezemer appreciates the fact that I have posted Forth source-code
    so he can rip it off (because he can't write Forth source-code himself),
    but he will still continue to fling insults at me while he is ripping off my code.

    Hans is a typical maintenance programmer --- they are all alike --- they require somebody to write the code, then they rip it off and claim
    that they wrote it themselves. Testra employed a string of maintenance programmers after I left who claimed to be instant experts in MFX,
    but all of them failed to learn to program in MFX --- maybe Testra will
    hire Hans Bezemer next, as he seems to be their type.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hugh Aguilar on Thu Sep 28 15:33:14 2023
    On 28/09/2023 1:32 pm, Hugh Aguilar wrote:
    ...
    Hans Bezemer

    BTW, I can rip your NOVICE package till the last byte.

    Hans Bezemer appreciates the fact that I have posted Forth source-code
    so he can rip it off (because he can't write Forth source-code himself),
    but he will still continue to fling insults at me while he is ripping off my code.

    Hans wasn't saying you were behaving like a goose - it was BSD.
    A BSD license would count for nothing if an author could revoke it.
    You're the first person I'm aware who has tried.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to S Jack on Thu Sep 28 23:09:13 2023
    On 28/09/2023 12:04 am, S Jack wrote:
    On Wednesday, September 27, 2023 at 4:00:57 AM UTC-5, dxf wrote:

    I've noted a good amount of newbie activity on retro forums. Everything from

    If I knew nothing of Forth, didn't know any better and
    stumbled into this group, I would be out of here very
    quickly. Not because of the bickering of silly people, but
    because of the primary subject matter discussed here,
    compliance and nazi coding. However, important it is to
    the professionals and wantabes, it ain't of general
    programming interest and makes Forth look difficult and
    problematic.
    Fig provided a nice small sufficient program to work with
    and published Forth Dimensions that provided code bits,
    ideas and news that fostered interest, very little of which
    means anything to today's group here. So yes, retro is
    a draw back when Forth was fun.

    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to dxf on Thu Sep 28 09:07:40 2023
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?
    Fig made Forth popular and the rest is nature.
    Everyone could make a better forth, Forths abound
    and need came to corral. At that time the Internet
    was coming into public use, publications gave way
    to news groups and podcasts.
    The venue makes a difference. A publication provides
    order, code and ideas presented in whole and bitching
    relegated to small paragraph in letters to the editor.
    News groups have different dynamics and chaos is
    more the norm. A good place to hash stuff out by the
    knowledgeable but a rough ride for ones with little
    background and of little patience. Podcasts should be more palpable.
    --
    me

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Zbig@21:1/5 to All on Thu Sep 28 08:22:50 2023
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    The good thing about Forth standards is that there are so many
    to choose from. :D

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From John Hart@21:1/5 to Zbig on Thu Sep 28 10:34:26 2023
    On Thursday, September 28, 2023 at 8:22:52 AM UTC-7, Zbig wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    The good thing about Forth standards is that there are so many
    to choose from. :D

    In the 90s I proposed Absolute Forth, a simple defining language to describe Forth variants.
    The idea was to make is so automated tools could convert library functions from one variant to
    another. At the time the idea went over like a lead balloon, probably because it used local variables to define stack operations ... : OVER { a b - - a b a } a b a ; ...
    which Forth Fundimentalists strongly objected to.
    jrh
    Reality is an information process, set in montion and sustained by God for a purpose.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Lorem Ipsum@21:1/5 to Jurgen Pitaske on Thu Sep 28 11:40:13 2023
    On Thursday, September 28, 2023 at 2:23:20 PM UTC-4, Jurgen Pitaske wrote:
    On Thursday, 28 September 2023 at 18:34:29 UTC+1, John Hart wrote:
    On Thursday, September 28, 2023 at 8:22:52 AM UTC-7, Zbig wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    The good thing about Forth standards is that there are so many
    to choose from. :D
    In the 90s I proposed Absolute Forth, a simple defining language to describe Forth variants.
    The idea was to make is so automated tools could convert library functions from one variant to
    another. At the time the idea went over like a lead balloon, probably because
    it used local variables to define stack operations ... : OVER { a b - - a b a } a b a ; ...
    which Forth Fundimentalists strongly objected to.
    jrh
    Reality is an information process, set in montion and sustained by God for a purpose.
    ANY idea or definition that avoids the availabitiy if 50 or 100+ Forths is to be applauded..
    In comparison to other languages so many Forths just lead to death of this wondeful language.

    Then we need to create the ultimate forth that can rule them all!

    --

    Rick C.

    + Get 1,000 miles of free Supercharging
    + Tesla referral code - https://ts.la/richard11209

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jurgen Pitaske@21:1/5 to John Hart on Thu Sep 28 11:23:18 2023
    On Thursday, 28 September 2023 at 18:34:29 UTC+1, John Hart wrote:
    On Thursday, September 28, 2023 at 8:22:52 AM UTC-7, Zbig wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    The good thing about Forth standards is that there are so many
    to choose from. :D
    In the 90s I proposed Absolute Forth, a simple defining language to describe Forth variants.
    The idea was to make is so automated tools could convert library functions from one variant to
    another. At the time the idea went over like a lead balloon, probably because
    it used local variables to define stack operations ... : OVER { a b - - a b a } a b a ; ...
    which Forth Fundimentalists strongly objected to.
    jrh
    Reality is an information process, set in montion and sustained by God for a purpose.

    ANY idea or definition that avoids the availabitiy if 50 or 100+ Forths is to be applauded..
    In comparison to other languages so many Forths just lead to death of this wondeful language.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to John Hart on Thu Sep 28 14:14:04 2023
    On Thursday, September 28, 2023 at 12:34:29 PM UTC-5, John Hart wrote:
    On Thursday, September 28, 2023 at 8:22:52 AM UTC-7, Zbig wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    The good thing about Forth standards is that there are so many
    to choose from. :D
    In the 90s I proposed Absolute Forth, a simple defining language to describe Forth variants.
    The idea was to make is so automated tools could convert library functions from one variant to
    another. At the time the idea went over like a lead balloon, probably because

    Toyed with some ideas along that line:
    i. Standard pigeon Forth
    Only specifies the gist of the word. Since its not an executable
    it can be a simple affair without "optimizations" just focusing
    on intended behavior.
    i. Standard behavior san names.
    Specified behaviors with given numeric labels. User use any
    names they want to fit a dialog that express their program.
    And multiple names can be used with the same behavior to
    fit the context where applied.
    (Went so far as to build Forth with pointer in the name field
    so names could be kept in one block and switched out with
    with alternate name sets.)

    Converting one Forth from and to standard forth is just a sed file.
    It's not completely straight forward as sometimes order matters.
    --
    me

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to S Jack on Fri Sep 29 10:41:56 2023
    On 29/09/2023 2:07 am, S Jack wrote:
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?

    Apparently. Folks who wanted a language got the beginnings of one
    and told to fill the rest out for themselves. Meanwhile Standard
    Teams and their helpers indulge themselves looking for wording that
    eliminates ambiguity - important in a language whose basis is concept
    rather than code.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to dxf on Thu Sep 28 21:26:21 2023
    On Thursday, September 28, 2023 at 7:41:59 PM UTC-5, dxf wrote:
    On 29/09/2023 2:07 am, S Jack wrote:
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?
    Apparently. Folks who wanted a language got the beginnings of one
    and told to fill the rest out for themselves. Meanwhile Standard
    Teams and their helpers indulge themselves looking for wording that eliminates ambiguity - important in a language whose basis is concept
    rather than code.

    Same size as Pascal, Pl1, assembly, ... etc. Anything more is application.
    --
    me

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to S Jack on Fri Sep 29 18:03:45 2023
    On 29/09/2023 2:26 pm, S Jack wrote:
    On Thursday, September 28, 2023 at 7:41:59 PM UTC-5, dxf wrote:
    On 29/09/2023 2:07 am, S Jack wrote:
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?
    Apparently. Folks who wanted a language got the beginnings of one
    and told to fill the rest out for themselves. Meanwhile Standard
    Teams and their helpers indulge themselves looking for wording that
    eliminates ambiguity - important in a language whose basis is concept
    rather than code.

    Same size as Pascal, Pl1, assembly, ... etc. Anything more is application.

    In that case there ought to be countless Forth newcomers busily writing applications :)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to dxf on Fri Sep 29 06:11:21 2023
    On Friday, September 29, 2023 at 3:03:48 AM UTC-5, dxf wrote:
    On 29/09/2023 2:26 pm, S Jack wrote:
    On Thursday, September 28, 2023 at 7:41:59 PM UTC-5, dxf wrote:
    On 29/09/2023 2:07 am, S Jack wrote:
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?
    Apparently. Folks who wanted a language got the beginnings of one
    and told to fill the rest out for themselves. Meanwhile Standard
    Teams and their helpers indulge themselves looking for wording that
    eliminates ambiguity - important in a language whose basis is concept
    rather than code.

    Same size as Pascal, Pl1, assembly, ... etc. Anything more is application.
    In that case there ought to be countless Forth newcomers busily writing applications :)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S Jack@21:1/5 to dxf on Fri Sep 29 06:14:50 2023
    On Friday, September 29, 2023 at 3:03:48 AM UTC-5, dxf wrote:
    On 29/09/2023 2:26 pm, S Jack wrote:
    On Thursday, September 28, 2023 at 7:41:59 PM UTC-5, dxf wrote:
    On 29/09/2023 2:07 am, S Jack wrote:
    On Thursday, September 28, 2023 at 8:09:18 AM UTC-5, dxf wrote:
    On 28/09/2023 12:04 am, S Jack wrote:
    But Fig is directly responsible for where Forth is today. Washing
    its hands of fig-Forth (it had served its purpose we were told),
    Fig found itself a new role - to facilitate and develop a Forth
    Standard through the FST (Forth Standards Team). FST gave us
    Forth-79 and Forth-83. Forth-83 was in turn the basis document
    of ANS-Forth.

    A bad thing?
    Apparently. Folks who wanted a language got the beginnings of one
    and told to fill the rest out for themselves. Meanwhile Standard
    Teams and their helpers indulge themselves looking for wording that
    eliminates ambiguity - important in a language whose basis is concept
    rather than code.

    Same size as Pascal, Pl1, assembly, ... etc. Anything more is application.
    In that case there ought to be countless Forth newcomers busily writing applications :)

    Spoon-fed provides quantity but I much prefer the flavor of
    free-range.

    --
    me

    (sorry about that last miss-fire, what designer puts the post button where one is to start typing.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to S Jack on Fri Sep 29 17:32:32 2023
    On Thursday, September 28, 2023 at 2:14:06 PM UTC-7, S Jack wrote:
    Converting one Forth from and to standard forth is just a sed file.
    It's not completely straight forward as sometimes order matters.

    You are assuming that all Forth designs are the same as ANS-Forth
    except with different names for words or having more words (such as
    having BOUNDS be a primitive rather than use OVER + SWAP).
    This isn't true though.

    ANS-Forth is very much based on Charles Moore's Forth for the
    PDP-11 written in the 1970s. The PDP-11 had a shortage of registers
    and most of the ANS-Forth design decisions assume a shortage of
    registers, although this was no longer an issue in 1994 (it wasn't
    an issue in 1983 either, as we already had the MC68000).

    For example, a big part of why ANS-Forth code is hard to read
    is that single and double-precision numbers are jumbled together
    on the same data-stack. A better design is to have a separate stack
    for double-precision numbers.
    D would remove a signed number from the single stack, then
    push an equivalent signed double to the double stack.
    D would be like S>D except for unsigned singles.
    M* would multiply two numbers on the single stack
    (and remove them), then push the product to the double stack.
    UM/MOD would unsigned divide a double on the double stack
    by a number on the single stack, then push the remainder and quotient
    to the single stack.
    SAFE-UM/MOD would unsigned divide a double on the double stack
    by a number on the single stack, then push the double-precision
    remainder and quotient to the double stack.
    etc.

    Your SED file isn't going to convert code from a Forth that is
    designed intelligently to run under ANS-Forth.

    Note also that SAFE-UM/MOD can't be written in ANS-Forth,
    despite the fact that it is used internally by # for pictured numbers. ANS-Forth provides UM/MOD (6.1.2370) but says:
    "An ambiguous condition exists if [the denominator] is zero or if
    the quotient lies outside the range of a single-cell unsigned integer."
    What are you supposed to do if your quotient overflows, which will
    happen if you have a small denominator?
    What are you supposed to do if your remainder overflows, which will
    happen if you have a large denominator?
    The ANS-Forth document routinely uses the term "ambiguous condition"
    that means: "up Shit Creek in a wire boat with a cardboard paddle."

    ANS-Forth is really worthless from a technical standpoint.
    ANS-Forth was a marketing gimmick from Elizabeth Rather.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hugh Aguilar on Sat Sep 30 18:09:43 2023
    On 30/09/2023 10:32 am, Hugh Aguilar wrote:
    On Thursday, September 28, 2023 at 2:14:06 PM UTC-7, S Jack wrote:
    Converting one Forth from and to standard forth is just a sed file.
    It's not completely straight forward as sometimes order matters.

    You are assuming that all Forth designs are the same as ANS-Forth
    except with different names for words or having more words (such as
    having BOUNDS be a primitive rather than use OVER + SWAP).
    This isn't true though.

    ANS-Forth is very much based on Charles Moore's Forth for the
    PDP-11 written in the 1970s. The PDP-11 had a shortage of registers
    and most of the ANS-Forth design decisions assume a shortage of
    registers, although this was no longer an issue in 1994 (it wasn't
    an issue in 1983 either, as we already had the MC68000).

    For example, a big part of why ANS-Forth code is hard to read
    is that single and double-precision numbers are jumbled together
    on the same data-stack. A better design is to have a separate stack
    for double-precision numbers.
    D would remove a signed number from the single stack, then
    push an equivalent signed double to the double stack.
    D would be like S>D except for unsigned singles.
    M* would multiply two numbers on the single stack
    (and remove them), then push the product to the double stack.
    UM/MOD would unsigned divide a double on the double stack
    by a number on the single stack, then push the remainder and quotient
    to the single stack.
    SAFE-UM/MOD would unsigned divide a double on the double stack
    by a number on the single stack, then push the double-precision
    remainder and quotient to the double stack.
    etc.

    Your SED file isn't going to convert code from a Forth that is
    designed intelligently to run under ANS-Forth.

    Note also that SAFE-UM/MOD can't be written in ANS-Forth,
    despite the fact that it is used internally by # for pictured numbers. ANS-Forth provides UM/MOD (6.1.2370) but says:
    "An ambiguous condition exists if [the denominator] is zero or if
    the quotient lies outside the range of a single-cell unsigned integer."
    What are you supposed to do if your quotient overflows, which will
    happen if you have a small denominator?
    What are you supposed to do if your remainder overflows, which will
    happen if you have a large denominator?
    The ANS-Forth document routinely uses the term "ambiguous condition"
    that means: "up Shit Creek in a wire boat with a cardboard paddle."

    ANS-Forth is really worthless from a technical standpoint.
    ANS-Forth was a marketing gimmick from Elizabeth Rather.

    Intel ought be ashamed of itself for supporting such flawed operators.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From none) (albert@21:1/5 to hughaguilar96@gmail.com on Sat Sep 30 11:46:25 2023
    In article <c2cbeb05-8191-4cd5-a015-825bf8624a15n@googlegroups.com>,
    Hugh Aguilar <hughaguilar96@gmail.com> wrote:
    <SNIP>
    Note also that SAFE-UM/MOD can't be written in ANS-Forth,
    despite the fact that it is used internally by # for pictured numbers. >ANS-Forth provides UM/MOD (6.1.2370) but says:
    "An ambiguous condition exists if [the denominator] is zero or if
    the quotient lies outside the range of a single-cell unsigned integer."
    What are you supposed to do if your quotient overflows, which will
    happen if you have a small denominator?
    What are you supposed to do if your remainder overflows, which will
    happen if you have a large denominator?
    The ANS-Forth document routinely uses the term "ambiguous condition"
    that means: "up Shit Creek in a wire boat with a cardboard paddle."

    ANS-Forth is really worthless from a technical standpoint.
    ANS-Forth was a marketing gimmick from Elizabeth Rather.

    Ambiguous means that the system is not obliged to detect the
    condition. However a high quality system exists
    exist that detects and flags ambiguous conditions.
    For example gforth does that for a substantantial part of
    ambiguous conditions.

    Groetje Albert
    --
    Don't praise the day before the evening. One swallow doesn't make spring.
    You must not say "hey" before you have crossed the bridge. Don't sell the
    hide of the bear until you shot it. Better one bird in the hand than ten in
    the air. First gain is a cat spinning. - the Wise from Antrim -

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to albert on Sat Sep 30 20:59:54 2023
    On 30/09/2023 7:46 pm, albert wrote:
    In article <c2cbeb05-8191-4cd5-a015-825bf8624a15n@googlegroups.com>,
    Hugh Aguilar <hughaguilar96@gmail.com> wrote:
    <SNIP>
    Note also that SAFE-UM/MOD can't be written in ANS-Forth,
    despite the fact that it is used internally by # for pictured numbers.
    ANS-Forth provides UM/MOD (6.1.2370) but says:
    "An ambiguous condition exists if [the denominator] is zero or if
    the quotient lies outside the range of a single-cell unsigned integer."
    What are you supposed to do if your quotient overflows, which will
    happen if you have a small denominator?
    What are you supposed to do if your remainder overflows, which will
    happen if you have a large denominator?
    The ANS-Forth document routinely uses the term "ambiguous condition"
    that means: "up Shit Creek in a wire boat with a cardboard paddle."

    ANS-Forth is really worthless from a technical standpoint.
    ANS-Forth was a marketing gimmick from Elizabeth Rather.

    Ambiguous means that the system is not obliged to detect the
    condition. However a high quality system exists
    exist that detects and flags ambiguous conditions.
    For example gforth does that for a substantantial part of
    ambiguous conditions.

    Why? Does the programmer need to be told the horse in his charge has bolted?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Sat Sep 30 14:39:44 2023
    On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote:
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote:
    On Wednesday, June 16, 2021 at 8:27:07 PM UTC+2, Rod Pemberton wrote:
    In other words, Hugh must always see himself as the "King of the Hill", as royalty, as perfect, and in total control, in regards to all things Forth. All conflict with Hugh shall be repressed, suppressed, and oppressed, for Hugh is the King! All hail mighty Hugh!
    That's true. I can remember a discussion where it was something about "experts". https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ
    I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is, but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!
    The point that makes him *really* mad is that I neither care about labels nor
    value being the "biggest ape on the hill". The only metric I find useful is what I
    can do with what I got upstairs.
    Hans also has an instructional video teaching the subject of implementing
    a string stack, which he doesn't know how to do. His video provided a graphical illustration of swapping two strings --- one string gets copied into a pad somewhere, then the other string gets copied to where it was, then the string in the pad gets copied to where that string was.
    That was an hilarious video! Hans doesn't know what COW (copy-on-write)
    is, or know that it is much faster to just swap the pointers to the strings rather than swap the entire strings.
    Hans doesn't have any knowledge "upstairs" --- just a lot of hot air --- what he
    does with what he has upstairs is make hilariously stupid instructional videos.
    Since he is wired completely differently (he is actually *begging* for validation)
    it intensely irritates him when somebody is not racing him or giving him kudos
    for work he finds extremely important and valuable.
    Hans is still not making any sense.
    If I wanted "validation" I would have stayed on the Forth-200x mailing list so my super-duper expert status would be validated by the Forth-200x committee. Being on the Forth-200x mailing list is essentially the same
    as having reference letters from Stephen Pelc, Anton Ertl, Bernd Paysan, Peter Knaggs, etc., that can be used as validation of Forth expertise.
    The whole point of being on the Forth-200x mailing list is so that,
    in the unlikely case that a job in Forth is offered, the candidate can explain
    that he is not just a mere Forth programmer, but he sets the standard for the entire Forth community. All Forth programmers rely on the Forth-200x experts to do their thinking for them! The Forth-200x committee considers them to be the elite whose opinion on Forth is valuable. Woo hoo!
    It is what it is.. What I do value Hugh for is that he's actually written Forth code -
    so that alone IMHO justifies him being here
    There was this thread: https://groups.google.com/g/comp.lang.forth/c/hp1MbSkew08/m/os5OYTOeBAAJ Hans said:

    On Sunday, February 26, 2023 at 7:37:35 AM UTC-7, Hans Bezemer wrote:
    But maybe now you understand why I don't care about you, Hugh. Or anything you say about me. Or make me stop what I'm doing. To me, you're just a nobody
    with a crazy opinion I don't care for.

    Hans Bezemer

    BTW, I can rip your NOVICE package till the last byte.

    Hans Bezemer appreciates the fact that I have posted Forth source-code
    so he can rip it off (because he can't write Forth source-code himself),
    but he will still continue to fling insults at me while he is ripping off my code.

    Hans is a typical maintenance programmer --- they are all alike --- they require somebody to write the code, then they rip it off and claim
    that they wrote it themselves. Testra employed a string of maintenance programmers after I left who claimed to be instant experts in MFX,
    but all of them failed to learn to program in MFX --- maybe Testra will
    hire Hans Bezemer next, as he seems to be their type.

    Hugh, I'm always thankful when you dedicate an entire episode of your
    famous rants to me. I know this is very therapeutic for you and I sincerily hope it contributes to your mental health in anyway.

    I know this thread has been hard for you. There are still some cognative dissonance issues to settle. I know you're convinced to be a very
    inventive, clever programmer - but the cold hard truth you slowly start
    to accept is that no matter how liberal your license is - if nobody wants
    to rip your code, I'd better be a pleasant hobby - and not a profession. Because that would be delusional.

    If I may give you a little advise - use a bit of humor in your roasts! You'll be much better apppreciated. And use generally accepted definitions and concepts. That doesn't leave an impression of a raving lunatic - I know
    you want to avoid that, so that'll need a little more exercise. But all in all -
    funnier than Lilly Singh, so you're on the right track.

    I think it's time for your medication now.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hans Bezemer on Sun Oct 1 12:20:01 2023
    On 1/10/2023 8:39 am, Hans Bezemer wrote:
    On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote:
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote:
    On Wednesday, June 16, 2021 at 8:27:07 PM UTC+2, Rod Pemberton wrote: >>>> In other words, Hugh must always see himself as the "King of the Hill", >>>> as royalty, as perfect, and in total control, in regards to all things >>>> Forth. All conflict with Hugh shall be repressed, suppressed, and
    oppressed, for Hugh is the King! All hail mighty Hugh!
    That's true. I can remember a discussion where it was something about
    "experts". https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ
    I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is, >> but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!
    The point that makes him *really* mad is that I neither care about labels nor
    value being the "biggest ape on the hill". The only metric I find useful is what I
    can do with what I got upstairs.
    Hans also has an instructional video teaching the subject of implementing
    a string stack, which he doesn't know how to do. His video provided a
    graphical illustration of swapping two strings --- one string gets copied
    into a pad somewhere, then the other string gets copied to where it was,
    then the string in the pad gets copied to where that string was.
    That was an hilarious video! Hans doesn't know what COW (copy-on-write)
    is, or know that it is much faster to just swap the pointers to the strings >> rather than swap the entire strings.
    Hans doesn't have any knowledge "upstairs" --- just a lot of hot air --- what he
    does with what he has upstairs is make hilariously stupid instructional videos.
    Since he is wired completely differently (he is actually *begging* for validation)
    it intensely irritates him when somebody is not racing him or giving him kudos
    for work he finds extremely important and valuable.
    Hans is still not making any sense.
    If I wanted "validation" I would have stayed on the Forth-200x mailing list >> so my super-duper expert status would be validated by the Forth-200x
    committee. Being on the Forth-200x mailing list is essentially the same
    as having reference letters from Stephen Pelc, Anton Ertl, Bernd Paysan,
    Peter Knaggs, etc., that can be used as validation of Forth expertise.
    The whole point of being on the Forth-200x mailing list is so that,
    in the unlikely case that a job in Forth is offered, the candidate can explain
    that he is not just a mere Forth programmer, but he sets the standard for
    the entire Forth community. All Forth programmers rely on the Forth-200x
    experts to do their thinking for them! The Forth-200x committee considers
    them to be the elite whose opinion on Forth is valuable. Woo hoo!
    It is what it is.. What I do value Hugh for is that he's actually written Forth code -
    so that alone IMHO justifies him being here
    There was this thread:
    https://groups.google.com/g/comp.lang.forth/c/hp1MbSkew08/m/os5OYTOeBAAJ
    Hans said:

    On Sunday, February 26, 2023 at 7:37:35 AM UTC-7, Hans Bezemer wrote:
    But maybe now you understand why I don't care about you, Hugh. Or anything >>> you say about me. Or make me stop what I'm doing. To me, you're just a nobody
    with a crazy opinion I don't care for.

    Hans Bezemer

    BTW, I can rip your NOVICE package till the last byte.

    Hans Bezemer appreciates the fact that I have posted Forth source-code
    so he can rip it off (because he can't write Forth source-code himself),
    but he will still continue to fling insults at me while he is ripping off my code.

    Hans is a typical maintenance programmer --- they are all alike --- they
    require somebody to write the code, then they rip it off and claim
    that they wrote it themselves. Testra employed a string of maintenance
    programmers after I left who claimed to be instant experts in MFX,
    but all of them failed to learn to program in MFX --- maybe Testra will
    hire Hans Bezemer next, as he seems to be their type.

    Hugh, I'm always thankful when you dedicate an entire episode of your
    famous rants to me. I know this is very therapeutic for you and I sincerily hope it contributes to your mental health in anyway.

    I know this thread has been hard for you. There are still some cognative dissonance issues to settle. I know you're convinced to be a very
    inventive, clever programmer - but the cold hard truth you slowly start
    to accept is that no matter how liberal your license is - if nobody wants
    to rip your code, I'd better be a pleasant hobby - and not a profession. Because that would be delusional.

    Well, licenses in a hobby situation are rather delusional too. Hobbies
    are supposed to be about fun - not ownership.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Sat Sep 30 20:41:29 2023
    On Saturday, September 30, 2023 at 2:39:46 PM UTC-7, Hans Bezemer wrote:
    On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote:
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote: https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is,
    but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!

    ... use generally accepted definitions and
    concepts. That doesn't leave an impression of a raving lunatic

    Hans Bezemer doesn't know what Harvard Architecture is. That is dumb!
    He is ashamed of his failure to understand the accepted definition and
    concept of Harvard Architecture --- this is why he resorts to ad hominem attacks against me.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Sat Sep 30 23:47:42 2023
    On Sunday, October 1, 2023 at 5:41:31 AM UTC+2, Hugh Aguilar wrote:
    On Saturday, September 30, 2023 at 2:39:46 PM UTC-7, Hans Bezemer wrote:
    On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote:
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote: https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is,
    but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!
    ... use generally accepted definitions and
    concepts. That doesn't leave an impression of a raving lunatic
    Hans Bezemer doesn't know what Harvard Architecture is. That is dumb!
    He is ashamed of his failure to understand the accepted definition and concept of Harvard Architecture --- this is why he resorts to ad hominem attacks against me.

    What's dumb is that you use your own definition. That's not how science works. What's dumb is that you think that the most elaborate algorithm is the best choice in all situations. What's dumb is that you don't do your research. What's
    dumb is seeking validation through narcicism. It doesn't work, Hugh.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hans Bezemer on Sun Oct 1 21:08:04 2023
    On 1/10/2023 5:47 pm, Hans Bezemer wrote:
    On Sunday, October 1, 2023 at 5:41:31 AM UTC+2, Hugh Aguilar wrote:
    On Saturday, September 30, 2023 at 2:39:46 PM UTC-7, Hans Bezemer wrote: >>> On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote: >>>> On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote: >>>> https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ >>>> I'm surprised that Hans Bezemer would provide a link to that thread.
    In it I was pointing out that he doesn't know what Harvard Architecture is,
    but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!
    ... use generally accepted definitions and
    concepts. That doesn't leave an impression of a raving lunatic
    Hans Bezemer doesn't know what Harvard Architecture is. That is dumb!
    He is ashamed of his failure to understand the accepted definition and
    concept of Harvard Architecture --- this is why he resorts to ad hominem
    attacks against me.

    What's dumb is that you use your own definition. That's not how science works.
    What's dumb is that you think that the most elaborate algorithm is the best choice in all situations. What's dumb is that you don't do your research. What's
    dumb is seeking validation through narcicism. It doesn't work, Hugh.

    They don't make narcissists like they used to - a person who could pull miracles from thin air despite all the odds and critics. Today it's a
    blame game - a long list of reasons as to why stuff didn't get done.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Sun Oct 1 09:12:11 2023
    On Saturday, September 30, 2023 at 11:47:45 PM UTC-7, Hans Bezemer wrote:
    On Sunday, October 1, 2023 at 5:41:31 AM UTC+2, Hugh Aguilar wrote:
    On Saturday, September 30, 2023 at 2:39:46 PM UTC-7, Hans Bezemer wrote:
    On Thursday, September 28, 2023 at 5:32:29 AM UTC+2, Hugh Aguilar wrote:
    On Monday, September 25, 2023 at 3:37:20 AM UTC-7, Hans Bezemer wrote:
    https://groups.google.com/g/comp.lang.forth/c/GOPs3a_OtJk/m/DQBjLUJ0BwAJ
    I'm surprised that Hans Bezemer would provide a link to that thread. In it I was pointing out that he doesn't know what Harvard Architecture is,
    but he teaches the subject in his instructional videos.
    I would expect him to be ashamed of this and not want it mentioned.
    He thinks that segmented memory is Harvard Architecture! That is dumb!
    ... use generally accepted definitions and
    concepts. That doesn't leave an impression of a raving lunatic
    Hans Bezemer doesn't know what Harvard Architecture is. That is dumb!
    He is ashamed of his failure to understand the accepted definition and concept of Harvard Architecture --- this is why he resorts to ad hominem attacks against me.

    What's dumb is that you use your own definition. That's not how science works.

    The problem with comp.lang.forth is cult behavior.
    Hans Bezemer has been making those instructional videos for decades
    in which he says that his 4TH for the x86 is Harvard Architecture.
    He is making the entire Forth community appear to be abysmally ignorant!
    Nobody on comp.lang.forth ever tells him that he is not using the accepted definition of Harvard Architecture --- that he doesn't understand the concept. This is cult behavior! Hans is relying on political correctness --- on c.l.f. that mostly means attacking me with insults --- so long has he continues
    to be politically correct by c.l.f. standards, he gets to continue to post these hilariously stupid instructional videos and nobody on c.l.f. will
    point out that he is making the Forth community look stupid.
    This cult behavior on c.l.f. is why the whole world thinks that the Forth community is stupid --- Hans is indirectly supporting the C community.

    What's dumb is that you think that the most elaborate algorithm is the best choice in all situations.

    I think Hans is referring to the fact that my STRING-STACK.4TH uses
    COW (copy-on-write). This allows stack-juggling of the string-stack
    to be done by moving pointers rather than entire strings. The string doesn't get copied unless it is written to. For example, in DUP$ .$ the DUP$ doesn't copy the string because .$ is a consumer (it prints out the string and then drops
    it from the string-stack) so it just uses the pointer to the string that is on the
    string-stack then drops that pointer leaving the pointer that DUP$ copied.

    I never said that the "that the most elaborate algorithm is the best choice
    in all situations." I did say that my STRING-STACK.4TH is far superior to
    any of the pathetic attempts at writing a string-stack that the self-proclaimed
    Forth experts (including Hans Bezemer) have made since the time when
    Forth was invented in the 1970s and the need for a string-stack became apparent.

    What's dumb is that you don't do your research.

    I admit that I didn't do any research on the subject of Forth string-stacks prior to writing STRING-STACK.4TH. What would I research??? This was one
    of the many cases in which I wrote software that had never been done before.
    I had never heard of COW (copy-on-write) at that time, so I invented it myself. Only later on c.l.f. somebody told me that what I had was COW, so I looked
    up COW on Wikipedia and realized that this was true --- I wasn't surprised
    that this technique had already been invented and had a name (COW)
    because it is a pretty obvious technique (I figured out the concept with
    about ten minutes of thought before I began writing code, then it took
    me weeks of work to get STRING-STACK.4TH to where it is now).

    Another example of me writing software that had never been done before
    is when I wrote the MFX assembler for the MiniForth. I did not research
    the subject of out-of-ordering although I was vaguely aware of the concept
    from programming the Pentium that does out-of-ordering at runtime.
    John Hart didn't even about the concept of out-of-ordering, so he
    never told me to do out-of-ordering --- I just saw the need myself.
    I figured out the algorithm for out-of-ordering myself. My assembler
    did the out-of-ordering at compile-time, so it was easier to do than on the Pentium in which it is done by the processor at run-time. OTOH, the MiniForth has five fields to out-of-order, whereas the Pentium only has two pipelines
    (U and V) to out-of-order. The MiniForth was not similar to the Pentium
    so researching the Pentium wouldn't have helped me. There was nothing
    similar to the MiniForth that I could have researched. This is why I never
    do any research --- I'm always writing code for which nothing similar
    has ever been written.

    What's dumb is seeking validation through narcicism. It doesn't work, Hugh.

    I still don't know what Hans is talking about.
    The concept of "validation" implies an external authority that does the validating --- for comp.lang.forth this mostly means the Forth-200x
    committee --- I don't recognize any external authority being above me,
    so I'm not seeking validation. Juergen Pintaske thinks that I need
    validation from some association of plumbers in England to work
    as a plumber in America. Born parasites such as Juergen Pintaske
    are very focused on the concept of validation from an external
    authority because they don't have any pride of accomplishment due to
    not having any accomplishments --- they can only attach themselves
    like parasites to somebody who does have accomplishments.

    Stephen Pelc says that anybody can implement a better string-stack
    than I did, although he doesn't have any working code (he has a
    vague story about how some anonymous African implemented a
    far superior string-stack 30 years ago, but there is no evidence
    to indicate that he or the African know what COW is).
    I'm not getting any validation from the Forth-200x committee!
    Peter Knaggs banned me from the Forth-200x mailing list saying that
    I know nothing about Forth and have nothing to offer on the subject.
    Later on Peter Knaggs went to EuroForth with an article intended to
    educate the Forth community on the subject of linked lists: https://groups.google.com/g/comp.lang.forth/c/cMa8wV3OiY0/m/INBDVBh0BgAJ
    Peter Knaggs failed to write any working code, and his article was a
    jumble of nonsense. He doesn't know what inheritance is. He thinks
    that a linked list and an array are the same thing. He knows as much
    about linked lists as Hans Bezemer knows about Harvard Architecture,
    which is nothing --- but he wants to be teacher! --- this is why the
    Forth community has a reputation for stupidity in the real world.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hugh Aguilar on Mon Oct 2 12:23:37 2023
    On 2/10/2023 3:12 am, Hugh Aguilar wrote:
    On Saturday, September 30, 2023 at 11:47:45 PM UTC-7, Hans Bezemer wrote:
    What's dumb is seeking validation through narcicism. It doesn't work, Hugh.

    I still don't know what Hans is talking about.
    The concept of "validation" implies an external authority that does the validating

    Testra gave you a bad reference [allegedly]. Lack of validation. When
    nobody ran with the Novice pack - lack of validation. Humans are forever seeking validation - from peers, bosses, subordinates - it hardly matters.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to dxf on Sun Oct 1 19:42:39 2023
    On Sunday, October 1, 2023 at 6:23:41 PM UTC-7, dxf wrote:
    On 2/10/2023 3:12 am, Hugh Aguilar wrote:
    On Saturday, September 30, 2023 at 11:47:45 PM UTC-7, Hans Bezemer wrote:
    What's dumb is seeking validation through narcicism. It doesn't work, Hugh.

    I still don't know what Hans is talking about.
    The concept of "validation" implies an external authority that does the validating
    Testra gave you a bad reference [allegedly]. Lack of validation. When
    nobody ran with the Novice pack - lack of validation. Humans are forever seeking validation - from peers, bosses, subordinates - it hardly matters.

    Go away.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Mon Oct 2 04:18:13 2023
    On Sunday, October 1, 2023 at 6:12:13 PM UTC+2, Hugh Aguilar wrote:
    I think Hans is referring to the fact that my STRING-STACK.4TH uses
    COW (copy-on-write). This allows stack-juggling of the string-stack
    to be done by moving pointers rather than entire strings.
    So what? That's not rocket science. You make a dynamic string from my
    DSTRINGT package, put the address on a user stack (STACK). Add some stack juggling words - done. Yes, you got no fancy COW.

    I never said that the "that the most elaborate algorithm is the best choice in all situations." I did say that my STRING-STACK.4TH is far superior to any of the pathetic attempts at writing a string-stack that the self-proclaimed
    Forth experts (including Hans Bezemer) have made since the time when
    Forth was invented in the 1970s and the need for a string-stack became apparent.

    Technically, let's assume STRING-STACK.4TH is superior to any other solution. But
    you've got to import NOVICE, LIST and STRING-STACK to get it working. And what do
    I got then? A string stack. What does it do? It stores a few strings. Let's assume it's
    much faster (which I doubt, considering the massive amount of code it takes). How
    much time is that gonna shave off the user experience:

    $ time pp4th -x foosblbd.4pp
    Student
    Scientist
    Student
    Student
    Scientist
    Student
    Student
    Scientist
    Student
    Scientist

    real 0m0,035s
    user 0m0,021s
    sys 0m0,005s

    .. and that's including compilation and execution. So - explain to me: what is the
    endusers net benefit to this MASSIVE amount of extra code? Note the ENTIRE preprocessor itself is a little over 20K source.

    That, Hugh is the reason why I think this is well deserved:

    "What's dumb is that you think that the most elaborate algorithm is the best
    choice in all situations".

    Hans Bezemer

    https://sourceforge.net/p/forth-4th/code/HEAD/tree/trunk/4th.src/lib/dstringt.4th
    https://sourceforge.net/p/forth-4th/code/HEAD/tree/trunk/4th.src/lib/stack.4th

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Mon Oct 2 10:04:42 2023
    On Monday, October 2, 2023 at 4:18:15 AM UTC-7, Hans Bezemer wrote:
    Let's assume [STRING-STACK.4TH] is much faster [than Hans' string-stack
    that moves entire strings around]
    (which I doubt, considering the massive amount of code it takes).
    ...
    That, Hugh is the reason why I think this is well deserved:
    "What's dumb is that you think that the most elaborate algorithm is the best choice in all situations".

    I think that Hans Bezemer should get a job at Testra!
    He and John Hart think alike!
    Testra would finally have found the "team player" that they have always wanted!

    John Hart wrote a simulator for microprocessor code. He was using the
    8086 SCASB instruction with REPZ to search his table for matching opcodes.
    I said that a binary search would be faster. He said no, using the same
    kind of thinking that Hans Bezemer uses. To paraphrase:
    "I doubt that a binary search would be faster than a sequential search considering the massive amount of code that it takes. You always want to
    use the most elaborate algorithm --- this is beyond my comprehension!"

    This was discussed in this thread: https://groups.google.com/g/comp.lang.forth/c/s-6k_wdyrlE/m/tgZJ37jFAwAJ Actually, "discussed" isn't the correct word because John Hart never
    defended his use of a sequential search instead of a binary search.

    On Saturday, May 13, 2023 at 1:43:34 PM UTC-7, Hugh Aguilar wrote:
    On Friday, May 12, 2023 at 3:53:36 PM UTC-7, John Hart wrote:
    Something more compact and efficient than a CASE statement was
    needed for defining logic equations in the FPGA4th system.
    The solution was a set of words to build a look up table.

    key MAP[ n \ begins the process of building the table.
    a b MAP \ associates a with b
    c d MAP \ associates c with d
    e ]MAP \ ends the look up table process
    note: n specifies the key size (2^n) 0 = 1 byte, 1 = 2 bytes, 2 = 4 bytes

    At runtime, if the key = a, b is returned, if the key isn't found, e is returned

    Two more words to complete the set.
    a ]: starts compilation of code associated with a
    ;[ ends compilation

    : ALU { a b cmd - - c } \ example
    cmd MAP[ 1
    O ]: a b + ;[ MAP \ add
    1 ]: a b - ;[ MAP \ sub
    2 ]: a b AND ;[ MAP \ and
    3 ]: a b OR ;[ MAP \ or
    ]: 0 ;[ ]MAP
    EXECUTE
    ;

    jrh
    Way back in 1994 you told me that you had a super-fast jump-table look-up that could be used for simulating a processor. You recommended that I use this to simulate the MiniForth. You were using a sequential look-up!!!
    I pointed out that a binary search would be much faster. You said that what you had was "super fast" because the 8086 has an instruction that does
    a sequential search on a 16-bit number. That was dumb! A binary search is still going to be faster, except possibly for a very small array of numbers.

    My FAST-SWITCH> (a jump table) and SLOW-SWITCH> (a sorted array and
    a binary search) is posted here: https://groups.google.com/g/comp.lang.forth/c/HwxAddZ54mg/m/Fmg5xT08AAAJ
    I'm far ahead of you.
    Your MAP[ mentioned above is what you had in 1994. It wasn't any good then either.

    What is your point in posting on comp.lang.forth???
    You don't have anything to offer.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Mon Oct 2 10:33:53 2023
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    8086 SCASB instruction with REPZ to search his table for matching opcodes.
    I said that a binary search would be faster. He said no, using the same
    kind of thinking that Hans Bezemer uses. To paraphrase:
    "I doubt that a binary search would be faster than a sequential search considering the massive amount of code that it takes. You always want to
    use the most elaborate algorithm --- this is beyond my comprehension!"

    It depends on the number of opcodes you have to search. I spend a chapter
    in my manual explaining it. The fastest is of course direct access - where the thing to search is an index to a table.

    If you can't do that, CASE..ENDCASE may be your friend. I found a binary search paying off after about 100 entries - but not before. So a sequential search can be faster in some cases. Just test it. "Meten is weten".

    In the uBasic/4tH interpreter I used just about any technique in the book to speed
    it up.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Gerry Jackson@21:1/5 to Hans Bezemer on Mon Oct 2 22:04:32 2023
    On 02/10/2023 18:33, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    8086 SCASB instruction with REPZ to search his table for matching opcodes. >> I said that a binary search would be faster. He said no, using the same
    kind of thinking that Hans Bezemer uses. To paraphrase:
    "I doubt that a binary search would be faster than a sequential search
    considering the massive amount of code that it takes. You always want to
    use the most elaborate algorithm --- this is beyond my comprehension!"

    It depends on the number of opcodes you have to search. I spend a chapter
    in my manual explaining it. The fastest is of course direct access - where the
    thing to search is an index to a table.


    If you can't do that, CASE..ENDCASE may be your friend. I found a binary search
    paying off after about 100 entries - but not before. So a sequential search can
    be faster in some cases. Just test it. "Meten is weten".


    A binary search tree (BST) should be faster than a binary search because
    when searching, getting to the next node for comparison of keys is
    simpler. A BST, at node i only has to calculate 2*i to go left or 2*i+1
    to go right.

    An example can be seen at: https://github.com/gerryjackson/Forth-switch/blob/master/lib/bst.fth

    --
    Gerry

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Tue Oct 3 00:20:49 2023
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    8086 SCASB instruction with REPZ to search his table for matching opcodes. I said that a binary search would be faster. He said no, using the same kind of thinking that Hans Bezemer uses. To paraphrase:
    "I doubt that a binary search would be faster than a sequential search considering the massive amount of code that it takes. You always want to use the most elaborate algorithm --- this is beyond my comprehension!"
    It depends on the number of opcodes you have to search. I spend a chapter
    in my manual explaining it. The fastest is of course direct access - where the
    thing to search is an index to a table.

    If you can't do that, CASE..ENDCASE may be your friend. I found a binary search
    paying off after about 100 entries - but not before. So a sequential search can
    be faster in some cases. Just test it. "Meten is weten".

    In the uBasic/4tH interpreter I used just about any technique in the book to speed
    it up.

    Hans Bezemer

    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart
    is so incompetent that he would use a sequential search for 8-bit opcodes
    in which the sparse jump-table is only 256 words.

    "The fastest is of course direct access -
    where the thing to search is an index to a table."

    Thank you very much, Captain Obvious!

    In my novice-package I have FAST-SWITCH> that uses a sparse jump-table
    and SLOW-SWITCH> that uses a compacted jump-table with a
    binary-search look-up.
    Now, thanks to our Forth instructor Hans, we know what the names imply!
    In that thread mentioned previously I provided the documentation for
    my <SWITCH code: https://groups.google.com/g/comp.lang.forth/c/s-6k_wdyrlE/m/tgZJ37jFAwAJ

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From none) (albert@21:1/5 to hughaguilar96@gmail.com on Tue Oct 3 11:01:01 2023
    In article <f0710b94-647c-4563-b613-696e8038e1f6n@googlegroups.com>,
    Hugh Aguilar <hughaguilar96@gmail.com> wrote:
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    8086 SCASB instruction with REPZ to search his table for matching opcodes. >> > I said that a binary search would be faster. He said no, using the same
    kind of thinking that Hans Bezemer uses. To paraphrase:
    "I doubt that a binary search would be faster than a sequential search
    considering the massive amount of code that it takes. You always want to >> > use the most elaborate algorithm --- this is beyond my comprehension!"
    It depends on the number of opcodes you have to search. I spend a chapter
    in my manual explaining it. The fastest is of course direct access -
    where the
    thing to search is an index to a table.

    If you can't do that, CASE..ENDCASE may be your friend. I found a
    binary search
    paying off after about 100 entries - but not before. So a sequential
    search can
    be faster in some cases. Just test it. "Meten is weten".

    In the uBasic/4tH interpreter I used just about any technique in the
    book to speed
    it up.

    Hans Bezemer

    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart >is so incompetent that he would use a sequential search for 8-bit opcodes
    in which the sparse jump-table is only 256 words.


    In an assembler it is worth it using hash codes.
    There are tools to generate a perfect hash... if you are after speed.

    Groetjes Albert

    Hugh
    --
    Don't praise the day before the evening. One swallow doesn't make spring.
    You must not say "hey" before you have crossed the bridge. Don't sell the
    hide of the bear until you shot it. Better one bird in the hand than ten in
    the air. First gain is a cat spinning. - the Wise from Antrim -

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Tue Oct 3 09:03:39 2023
    On Tuesday, October 3, 2023 at 9:20:51 AM UTC+2, Hugh Aguilar wrote:

    In my novice-package I have FAST-SWITCH> that uses a sparse jump-table
    and SLOW-SWITCH> that uses a compacted jump-table with a
    binary-search look-up.
    Now, thanks to our Forth instructor Hans, we know what the names imply!
    In that thread mentioned previously I provided the documentation for
    my <SWITCH code:

    Well, you don't need massive libs to do all that. You can do it just as well with
    a page of code. I mean - you can even program a binary search recursive. I even like it better when tables are exposed - rather than hidden behind an ugly CASE..ENDCASE variant.

    ---8<---
    _binarySearch Param(3) ' value, start index, end index
    Local(1) ' The middle of the array

    If c@ < b@ Then ' Ok, signal we didn't find it
    Return (-1)
    Else
    d@ = SHL(b@ + c@, -1) ' Prevent overflow (LOL!)
    If a@ < @(d@) Then Return (FUNC(_binarySearch (a@, b@, d@-1)))
    If a@ > @(d@) Then Return (FUNC(_binarySearch (a@, d@+1, c@)))
    If a@ = @(d@) Then Return (d@) ' We found it, return index!
    EndIf
    ---8<---

    As a matter of fact - I only introduced that CASE construct when I found out there are
    situations where this is the fastest way to go. I *actually* did some timings - and
    when doing a string table of less than 25 elements, sequential search is on average
    faster. After that - sure, binary search rulez.

    I haven't found a situation where sequential search beats CASE..ENDCASE in case of integers. Up to a hundred elements, CASE..ENDCASE wins head down. And yes, afterwards it's binary search all the way.

    And yes, direct access is faster. However, it's not always obvious how you can use
    that technique. E.g. this is a table that answers such a question rather than to compute it:

    offset delimiters \ precalculated responses
    0 c, 0 c, 0 c, 1 c, 0 c, 1 c, 0 c, 0 c, \ 32 - 39
    1 c, 1 c, 1 c, 1 c, 1 c, 1 c, 0 c, 1 c, \ 40 - 47
    0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, \ 48 - 55
    0 c, 0 c, 0 c, 1 c, 1 c, 1 c, 1 c, 0 c, \ 56 - 63
    0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, \ 64 - 71
    0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, \ 72 - 79
    0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, \ 80 - 87
    0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 1 c, \ 88 - 94
    \ EQUALS +-*^/%=;(),<>#

    I even got a lightning fast integer factorial function that is based on the same technique.
    I don't need a Hug(h|e) SWITCH library to do all that for me.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to none albert on Tue Oct 10 18:17:02 2023
    On Tuesday, October 3, 2023 at 2:01:05 AM UTC-7, none albert wrote:
    In an assembler it is worth it using hash codes.
    There are tools to generate a perfect hash... if you are after speed.

    I'm talking about the simulator that looks up opcodes.
    Albert van der Horst says "assembler" --- he may be confused
    about what the topic of discussion is. I'm not talking about
    the symbol table --- try to be more alert!

    People are always telling me what I should do,
    although they have done nothing.

    A binary search, as I have in SLOW-SWITCH>, has predictable speed.
    It is easy to calculate the worst-case speed (the maximum number
    of comparisons), and the worst-case is not much worse than the
    best-case. Consistency is more important than average speed
    in a simulator because you may want to simulate the target processor
    running at a certain Mhz., and simulate each instruction's speed
    consistent to how many clock-cycles it takes on the target processor.
    A hash-table could be used in a simulator, but it would be difficult
    to predict the worst-case speed (a collision followed by a long
    sequential search).

    The hallmark of a script kiddie is to always say:
    "there are tools available to generate perfect code..."
    These tools might be generating a pile of crap. How do you know?
    To get a good hash function there has to be an exploitable
    bit-pattern in the values that you are running through your hash function.
    In a simulator, these values are 32-bit opcodes. There may not be an exploitable bit-pattern. If there is, it is going to be different for
    every target processor. My novice-package is general-purpose code.
    My SLOW-SWITCH> should work reasonably well on any target processor
    so I'm happy with it --- of course, Elizabeth Rather hated the concept
    of general-purpose code and said that a custom-written solution
    is always better (certainly it is always more time-consuming and
    error-prone to write).

    As a practical matter, I don't care that much anyway. I am only interested
    in 16-bit target processors, so I use FAST-SWITCH> every time --- the limit
    for FAST-SWITCH> is 64K so it works for 16-bit opcodes and the table
    is small enough (256KB) to easily fit on a modern desktop computer.

    First gain is a cat spinning. - the Wise from Antrim -

    I still have no idea what this means.
    It seems like pseudo-intellectual nonsense --- roughly comparable to
    the nonsense that DXforth spouts --- the problem with comp.lang.forth
    is too much cat-spinning and not enough code-writing.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From none) (albert@21:1/5 to hughaguilar96@gmail.com on Wed Oct 11 10:30:17 2023
    In article <9176e0ac-11b5-4048-b3e6-c671ea59467bn@googlegroups.com>,
    Hugh Aguilar <hughaguilar96@gmail.com> wrote:
    On Tuesday, October 3, 2023 at 2:01:05 AM UTC-7, none albert wrote:
    In an assembler it is worth it using hash codes.
    There are tools to generate a perfect hash... if you are after speed.

    I'm talking about the simulator that looks up opcodes.
    Albert van der Horst says "assembler" --- he may be confused
    about what the topic of discussion is. I'm not talking about
    the symbol table --- try to be more alert!

    People are always telling me what I should do,
    although they have done nothing.

    A binary search, as I have in SLOW-SWITCH>, has predictable speed.
    It is easy to calculate the worst-case speed (the maximum number
    of comparisons), and the worst-case is not much worse than the
    best-case. Consistency is more important than average speed
    in a simulator because you may want to simulate the target processor
    running at a certain Mhz., and simulate each instruction's speed
    consistent to how many clock-cycles it takes on the target processor.
    A hash-table could be used in a simulator, but it would be difficult
    to predict the worst-case speed (a collision followed by a long
    sequential search).

    You are not paying attention. A perfect hash is O(1) time.

    <Senseless insults snipped>

    Groetjes Albert
    --
    Don't praise the day before the evening. One swallow doesn't make spring.
    You must not say "hey" before you have crossed the bridge. Don't sell the
    hide of the bear until you shot it. Better one bird in the hand than ten in
    the air. First gain is a cat spinning. - the Wise from Antrim -

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S@21:1/5 to Hugh Aguilar on Wed Oct 11 08:04:32 2023
    On Tuesday, 3 October 2023 at 5:20:51 pm UTC+10, Hugh Aguilar wrote:
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the

    Hans Bezemer
    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart is so incompetent that he would use a sequential search for 8-bit opcodes
    in which the sparse jump-table is only 256 words.
    "The fastest is of course direct access -
    where the thing to search is an index to a table."
    Thank you very much, Captain Obvious!

    Hugh, for my home computer like chip I originally aimed to use 8 bit codes as the upper bits of the address space, which is ok in simple tasks. I am expanded this to multiple 8 bit spaces, and 16 bits etc and other sophisticated schemes into something
    new. But, I prefered 10 and 20 bits.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to All on Thu Oct 12 09:53:25 2023
    On Wednesday, October 11, 2023 at 8:04:35 AM UTC-7, S wrote:
    On Tuesday, 3 October 2023 at 5:20:51 pm UTC+10, Hugh Aguilar wrote:
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    Hans Bezemer
    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart
    is so incompetent that he would use a sequential search for 8-bit opcodes in which the sparse jump-table is only 256 words.
    "The fastest is of course direct access -
    where the thing to search is an index to a table."
    Thank you very much, Captain Obvious!
    Hugh, for my home computer like chip I originally aimed to use 8 bit codes as the upper bits of the address space, which is ok in simple tasks.
    I am expanded this to multiple 8 bit spaces, and 16 bits etc and other sophisticated schemes into something new. But, I prefered 10 and 20 bits.

    Is this in Verilog? Do you support interrupts?
    I have a design for a chip but I haven't built it due to not knowing Verilog.
    I did write an assembler and simulator for it.
    I'm interested in any design that has some creativity to it --- not just a
    fork of the J1 processor.

    My design is for the HX8K. It has especial support for a byte-code VM.
    The idea is to have a 64KW external memory that holds the Forth compiler, application code and data (more 64KW banks can be provided for large
    amounts of data, but the Forth code has to be in the 0th bank).
    The 8KW of internal memory is divided into 5KW for machine-code
    and 3KW for data. ISRs and other speed-critical code are assembled.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Lorem Ipsum@21:1/5 to Hugh Aguilar on Thu Oct 12 14:23:34 2023
    On Thursday, October 12, 2023 at 12:53:28 PM UTC-4, Hugh Aguilar wrote:
    On Wednesday, October 11, 2023 at 8:04:35 AM UTC-7, S wrote:
    On Tuesday, 3 October 2023 at 5:20:51 pm UTC+10, Hugh Aguilar wrote:
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    Hans Bezemer
    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart
    is so incompetent that he would use a sequential search for 8-bit opcodes
    in which the sparse jump-table is only 256 words.
    "The fastest is of course direct access -
    where the thing to search is an index to a table."
    Thank you very much, Captain Obvious!
    Hugh, for my home computer like chip I originally aimed to use 8 bit codes as the upper bits of the address space, which is ok in simple tasks.
    I am expanded this to multiple 8 bit spaces, and 16 bits etc and other sophisticated schemes into something new. But, I prefered 10 and 20 bits.
    Is this in Verilog? Do you support interrupts?
    I have a design for a chip but I haven't built it due to not knowing Verilog.
    I did write an assembler and simulator for it.
    I'm interested in any design that has some creativity to it --- not just a fork of the J1 processor.

    My design is for the HX8K.

    I'm curious. What did you put in your design that is specific for the HX8K?

    It has especial support for a byte-code VM.
    The idea is to have a 64KW external memory that holds the Forth compiler, application code and data (more 64KW banks can be provided for large
    amounts of data, but the Forth code has to be in the 0th bank).
    The 8KW of internal memory is divided into 5KW for machine-code
    and 3KW for data. ISRs and other speed-critical code are assembled.

    Why external memory, rather than internal memory in a different FPGA? I think it is easy to find them with 64 kB of internal RAM.

    --

    Rick C.

    -- Get 1,000 miles of free Supercharging
    -- Tesla referral code - https://ts.la/richard11209

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to none albert on Thu Oct 12 14:53:01 2023
    On Wednesday, October 11, 2023 at 10:30:21 AM UTC+2, none albert wrote:
    In article <9176e0ac-11b5-4048...@googlegroups.com>,
    Hugh Aguilar <hughag...@gmail.com> wrote:
    On Tuesday, October 3, 2023 at 2:01:05 AM UTC-7, none albert wrote:
    In an assembler it is worth it using hash codes.
    There are tools to generate a perfect hash... if you are after speed.

    I'm talking about the simulator that looks up opcodes.
    Albert van der Horst says "assembler" --- he may be confused
    about what the topic of discussion is. I'm not talking about
    the symbol table --- try to be more alert!

    People are always telling me what I should do,
    although they have done nothing.

    A binary search, as I have in SLOW-SWITCH>, has predictable speed.
    It is easy to calculate the worst-case speed (the maximum number
    of comparisons), and the worst-case is not much worse than the
    best-case. Consistency is more important than average speed
    in a simulator because you may want to simulate the target processor >running at a certain Mhz., and simulate each instruction's speed >consistent to how many clock-cycles it takes on the target processor.
    A hash-table could be used in a simulator, but it would be difficult
    to predict the worst-case speed (a collision followed by a long
    sequential search).
    You are not paying attention. A perfect hash is O(1) time.

    Listening is not one of Hugh strengths. Changing the goalposts is. Praising and promoting his own pet libraries is. But listening? Not really..

    Hans Bezemer
    Groetjes Albert
    --
    Don't praise the day before the evening. One swallow doesn't make spring. You must not say "hey" before you have crossed the bridge. Don't sell the hide of the bear until you shot it. Better one bird in the hand than ten in the air. First gain is a cat spinning. - the Wise from Antrim -

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Lorem Ipsum on Thu Oct 12 19:28:32 2023
    On Thursday, October 12, 2023 at 2:23:36 PM UTC-7, Lorem Ipsum wrote:
    On Thursday, October 12, 2023 at 12:53:28 PM UTC-4, Hugh Aguilar wrote:
    My design is for the HX8K.
    I'm curious. What did you put in your design that is specific for the HX8K?

    I'm curious. Why do you think that I'm going to respond to you?
    I have told you dozens of times: PISS OFF!

    It has especial support for a byte-code VM.
    The idea is to have a 64KW external memory that holds the Forth compiler, application code and data (more 64KW banks can be provided for large amounts of data, but the Forth code has to be in the 0th bank).
    The 8KW of internal memory is divided into 5KW for machine-code
    and 3KW for data. ISRs and other speed-critical code are assembled.
    Why external memory, rather than internal memory in a different FPGA?
    I think it is easy to find them with 64 kB of internal RAM.

    I think that you should just leave me alone --- nasty troll!

    P.S. You are too stupid to know the difference between
    64KB and 64KW. You don't known that there is a difference in price
    between an 18-bit FPGA with 32KW of internal memory and the
    16-bit HX8K with 8KW of internal memory.
    I don't think that you are a programmer at all.
    You are a total fake. PISS OFF!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Fri Oct 13 00:41:09 2023
    On Friday, October 13, 2023 at 4:28:34 AM UTC+2, Hugh Aguilar wrote:
    I think that you should just leave me alone --- nasty troll!
    There are plenty of people here that would like to be left alone too. By
    a troll whose name shall not be mentioned.

    I don't think that you are a programmer at all.
    You are a total fake. PISS OFF!
    Why do you think you're qualified in any way to judge people who've worked
    for decades in that line of work? And why do you think people asked for that judgement, value that judgement - or even care about that judgement?

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Lorem Ipsum@21:1/5 to Hugh Aguilar on Fri Oct 13 03:53:19 2023
    On Thursday, October 12, 2023 at 10:28:34 PM UTC-4, Hugh Aguilar wrote:
    On Thursday, October 12, 2023 at 2:23:36 PM UTC-7, Lorem Ipsum wrote:
    On Thursday, October 12, 2023 at 12:53:28 PM UTC-4, Hugh Aguilar wrote:
    My design is for the HX8K.
    I'm curious. What did you put in your design that is specific for the HX8K?
    I'm curious. Why do you think that I'm going to respond to you?
    I have told you dozens of times: PISS OFF!
    It has especial support for a byte-code VM.
    The idea is to have a 64KW external memory that holds the Forth compiler,
    application code and data (more 64KW banks can be provided for large amounts of data, but the Forth code has to be in the 0th bank).
    The 8KW of internal memory is divided into 5KW for machine-code
    and 3KW for data. ISRs and other speed-critical code are assembled.
    Why external memory, rather than internal memory in a different FPGA?
    I think it is easy to find them with 64 kB of internal RAM.
    I think that you should just leave me alone --- nasty troll!

    You confuse me sometimes. You tell me not to respond to you, then you respond to me... which is it???


    P.S. You are too stupid to know the difference between
    64KB and 64KW.

    Yes, I missed that you were saying kW. So, how large are your words? If you say 18 bits, that's not likely. The iCE40 parts don't provide 9, 18 or 36 bit data paths like many other FPGAs.


    You don't known that there is a difference in price
    between an 18-bit FPGA with 32KW of internal memory and the
    16-bit HX8K with 8KW of internal memory.

    There are many prices for these devices. What you might not appreciate is that while Lattice prices through Digikey, may be close to actual prices you will get from other distribution, the prices for other brands are artificially high at Digikey,
    because they will negotiate better prices through other channels.


    I don't think that you are a programmer at all.
    You are a total fake. PISS OFF!

    I thought we had discussed this before. I am a hardware designer who programs as needed. I typically use VHDL for hardware and forth for software. You have your own special standards for who you consider to be a "programmer". That's not important to
    me. I use software as a tool to get my work done. I'm not trying to achieve sainthood through programming.

    I will say that from what you have described of your hardware designs, you are not much of a hardware designer. When I've tried to offer advice, you get cranky and refuse my suggestions. That's ok too. At least no one can blame me for your lack of
    progress.

    --

    Rick C.

    -+ Get 1,000 miles of free Supercharging
    -+ Tesla referral code - https://ts.la/richard11209

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dxf@21:1/5 to Hans Bezemer on Sat Oct 14 09:30:49 2023
    On 13/10/2023 6:41 pm, Hans Bezemer wrote:
    On Friday, October 13, 2023 at 4:28:34 AM UTC+2, Hugh Aguilar wrote:
    I think that you should just leave me alone --- nasty troll!
    There are plenty of people here that would like to be left alone too. By
    a troll whose name shall not be mentioned.

    I don't think that you are a programmer at all.
    You are a total fake. PISS OFF!

    Why do you think you're qualified in any way to judge people who've worked for decades in that line of work? And why do you think people asked for that judgement, value that judgement - or even care about that judgement?

    In any society the greatest insult is to be told one has 'achieved nothing'.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hugh Aguilar@21:1/5 to Hans Bezemer on Fri Oct 13 17:12:40 2023
    On Friday, October 13, 2023 at 12:41:11 AM UTC-7, Hans Bezemer wrote:
    On Friday, October 13, 2023 at 4:28:34 AM UTC+2, Hugh Aguilar wrote:
    I don't think that you [Rick Collins] are a programmer at all.
    You are a total fake. PISS OFF!

    Why do you think you're qualified in any way to judge people who've worked for decades in that line of work? And why do you think people asked for that judgement, value that judgement - or even care about that judgement?

    If John Hart had said in 1994 that I'm in no way qualified to write software except as a code-monkey who has to be told exactly what to do,
    then MFX would not have been written. Neither of the two programmers
    at Testra (John Hart and Steve Brault) were capable of writing MFX.

    I can easily see that Rick Collins is a total fake.
    He has never written any Forth code that anybody has ever seen.
    You are a total fake too --- you produce instructional videos in which
    you teach us that your 8086 Forth is "Harvard Architecture."

    During my job interview at Testra, John Hart told me that Tom Hart
    had written a text user-interface package in UR/Forth that he was
    very proud of, and he asked me if I wanted to become an expert in
    using it. I said: "No!" John Hart laughed and said: "Nobody ever does."
    I knew at that time that Tom Hart was a total fake. This was confirmed
    during my lengthy employment there when I saw Tom Hart show up
    every couple of weeks to spend a couple of hours acting like a big boss,
    but he never wrote any code or did any hardware design or made any
    technical contribution whatsoever.

    Tom Hart responded to Juergen Pintaske as his peer.
    This is because Juergen Pintaske is totally focused on the idea
    that a programmer needs validation from somebody important
    to be considered to be a programmer, and Tom Hart felt flattered
    that Juergen Pintaske considered him to be that important person.
    Juergen Pintaske felt flattered that Tom Hart responded to him
    because most people ignore him. Tom Hart and Juergen Pintaske
    mutually flattered each other --- effectively jerking each other off.

    Juergen Pintaske contacted your employer and tried to convince
    them to denounce you on comp.lang.forth the same way that
    he convinced Tom Hart to denounce me on comp.lang.forth.
    They did not respond to him.
    Now you support Juergen Pintaske in attacking me.
    Why don't you just be a man an admit that you have been wrong
    in your understanding of Harvard Architecture? Would it really
    kill you to admit your mistake? Instead you persist in being
    wrong, making a complete fool out of yourself --- and you ally
    yourself with Juergen Pintaske in attacking me to appease him
    so that he stops attacking you. Coward!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Hugh Aguilar on Sat Oct 14 08:41:45 2023
    On Saturday, October 14, 2023 at 2:12:44 AM UTC+2, Hugh Aguilar wrote:
    I can easily see that Rick Collins is a total fake.
    He has never written any Forth code that anybody has ever seen.
    I know of another guy who says he's written "fast switch" libs and "string stack" libs - and nobody has ever seen the code. It seems Rick is not the
    only fake wandering around in this forum.

    You are a total fake too --- you produce instructional videos in which
    you teach us that your 8086 Forth is "Harvard Architecture."
    Last time, I was thinking of challenging dxforth to take a bet with me
    that you would bring this up again. Gee - I should have done that! Darn!

    And I've had my own Forth compiler since 1994. I don't need to blame
    another vendor if my pet code doesn't work anymore. So who is the
    fake here?

    Juergen Pintaske contacted your employer and tried to convince
    them to denounce you on comp.lang.forth the same way that
    he convinced Tom Hart to denounce me on comp.lang.forth.
    They did not respond to him.
    I've been playing the corporate game for decades now. It comes with
    the job. Did "I've never written any Forth" really think I wouldn't be prepared? Think again.

    Now you support Juergen Pintaske in attacking me.
    I'm not attacking you. I've been trying for ages to talk some sense
    into you. But like I said before: you-just-don't-listen. You've been
    making a fool of yourself for ages - and you don't even seem to get
    it.

    So - that was fun. If you want to get serious, lemme know.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Lorem Ipsum@21:1/5 to Hans Bezemer on Sat Oct 14 22:30:25 2023
    On Saturday, October 14, 2023 at 11:41:47 AM UTC-4, Hans Bezemer wrote:

    I'm not attacking you. I've been trying for ages to talk some sense
    into you. But like I said before: you-just-don't-listen. You've been
    making a fool of yourself for ages - and you don't even seem to get
    it.

    It's not just himself who is being made a fool of. We (anyone to responds to him) are the fools.

    I would love to have a rational discussion with him. But there's always something that triggers his delusions of persecution. I think he is afraid of a discussion with me ever since he complained about some "inefficient" code I posted, where his
    approach had exactly the same issue. Others chimed into to point out that our code worked identically and he simply stopped replying. The reality is it was no big deal. It was just the hypocrisy of his remarks that made everyone dump on him.

    --

    Rick C.

    +- Get 1,000 miles of free Supercharging
    +- Tesla referral code - https://ts.la/richard11209

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hans Bezemer@21:1/5 to Lorem Ipsum on Sun Oct 15 06:39:58 2023
    On Sunday, October 15, 2023 at 7:30:28 AM UTC+2, Lorem Ipsum wrote:

    It's not just himself who is being made a fool of. We (anyone to responds to him) are the fools.
    I consider that a defensible position.

    I would love to have a rational discussion with him. But there's always something that triggers his delusions of persecution.
    Well, that's true. He certainly has some trigger points - although they
    differ per person. He also sees alliances where there are none. Most of
    us have only communicated here in the open - without using any other
    channels of communications. But he sees them conspiring behind his
    back - with the only objective to damage him.

    I can't deny there are some toxic elements here that are certainly out to damage people. That having said, it's not the majority of people he has
    a beef with.

    I think he is afraid of a discussion with me ever since he complained
    about some "inefficient" code I posted, where his approach had
    exactly the same issue. Others chimed into to point out that our code
    worked identically and he simply stopped replying.
    There are several "tactics" he uses. One is "moving the goalposts", the
    other is "plain contradiction". And yes, once cornered he just disappears -
    or plainly ignores any sensible arguments as if they've never been uttered.

    The sad thing is - although he has said and done despicable things to
    people, I've seen him operate once in quite a different way. I can just
    hope he starts to operate in a more constructive way some day. I still
    think he has that capacity - although there are plenty of reasons to
    differ with this point of view, since he's been going on in this fashion
    for so long. It's kind of sad.

    Hans Bezemer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S@21:1/5 to Hugh Aguilar on Thu Oct 19 23:18:00 2023
    On Friday, 13 October 2023 at 2:53:28 am UTC+10, Hugh Aguilar wrote:
    On Wednesday, October 11, 2023 at 8:04:35 AM UTC-7, S wrote:
    On Tuesday, 3 October 2023 at 5:20:51 pm UTC+10, Hugh Aguilar wrote:
    On Monday, October 2, 2023 at 10:33:55 AM UTC-7, Hans Bezemer wrote:
    On Monday, October 2, 2023 at 7:04:44 PM UTC+2, Hugh Aguilar wrote:
    John Hart wrote a simulator for microprocessor code. He was using the
    Hans Bezemer
    I meant SCASW not SCASB --- these were 16-bit opcodes --- not even John Hart
    is so incompetent that he would use a sequential search for 8-bit opcodes
    in which the sparse jump-table is only 256 words.
    "The fastest is of course direct access -
    where the thing to search is an index to a table."
    Thank you very much, Captain Obvious!
    Hugh, for my home computer like chip I originally aimed to use 8 bit codes as the upper bits of the address space, which is ok in simple tasks.
    I am expanded this to multiple 8 bit spaces, and 16 bits etc and other sophisticated schemes into something new. But, I prefered 10 and 20 bits.
    Is this in Verilog? Do you support interrupts?
    I have a design for a chip but I haven't built it due to not knowing Verilog.
    I did write an assembler and simulator for it.
    I'm interested in any design that has some creativity to it --- not just a fork of the J1 processor.

    My design is for the HX8K. It has especial support for a byte-code VM.
    The idea is to have a 64KW external memory that holds the Forth compiler, application code and data (more 64KW banks can be provided for large
    amounts of data, but the Forth code has to be in the 0th bank).
    The 8KW of internal memory is divided into 5KW for machine-code
    and 3KW for data. ISRs and other speed-critical code are assembled.

    Sorry Hugh, I completely missed this. I was coming back here to tell you,
    that it is obvious you are being persecuted. But, don't worry about the last 20 years, it's the next 20 years you need to concentrate on. Forget these people, make something good, and bring it out, but don't give up your
    present business.

    Anyway, back to your reply. I have just figured out the ISA/processing flow schemes, that's where it starts. I was sharing from my experience a way to overcome the 8 bit limitations. I've had numerous problems since covid (again) and am only just getting well enough again to do more work on my legal issue. So, I've basically had to give up helping my others and myself, to address this.
    I'm a pretty much help a chunk of people sort, but unfortunately, people not like
    that tend to block the way.

    Now, your design. Is the 8 or 5k is divided by 256? I wasn't so good last time to
    access my design memory properly, and should have suggested a seperate vector address space for the 256 locations or 16 or more bits each. This is a seperate bus,
    and can even be associative memory, so it passes onto the address bus, it can even
    Be that the 8 bit location call forms the upper 8 bits of available memory and the
    matching 8 bit location forms the offset. The issue is, without the vector locations,
    dividing the address space by 256, is an inefficient use of space, as routines will often
    not fit the space slot, and encroach on other slots. To use the encroached slot, you
    need an offset, if any room is left, or use a 16 bit vector table. But, to reduce size of the
    cpu 8 bit vectors in common memory, would be simpler. What you want, is a way to get
    the address in the slot into the address bus for next cycle. That would require some
    fancy hard like wiring, but as you are using fpga (is it) the forth cpu cycle should be
    so much slower, that you could run a seperate memory controller to see the 8 bit call
    coming in and in parallel at shorter cycle, load up the vector on the address bus next
    cycle, rather than take an extra 1-2 cycles to complete. It's all reduced size or increased
    performance. I try more sophisticated things to get many 8 bit call spaces, but one
    thing you should look at with these schemes, for code cross compatibility between
    spaces, is too declare the length, and maybe the start, of a code space to be divided
    up by 256. So, your 5k gets divided up by 256 by the compiler. But, now it becomes a
    pointer and as simple as mask bits to determine where the 8 bits go. Now, the 5k
    program can fit anywhere in any practical memory configuration.

    If you don't mind me asking, what do you plan to do with the processor?

    I wouldn't mind using some of these foga processors if they could get those 4 bit
    Chinese chip manufacturers (or watch chip manufacturers), with old chip equipment,
    to make a descent version of them, with memory inci style with simple graphics and
    sound (maybe with vectors). That's like 6000+ transistors plus memory. As I have
    said before, it is as simple as packaging a psram die in the same package as the
    processor, even two of them as a separate workspace, you could use as a graphics
    buffer buffer, or other use, with dma. I think I was planning on hitting them up at one
    stage with the idea of implementing one of the open source designs. Just another
    exotic cheap chip, with performance, to sell.

    Huge, I encourage you to go somewhere with it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From S@21:1/5 to All on Sun Nov 19 02:04:32 2023
    On Saturday, October 14, 2023 at 10:12:44 AM UTC+10, Hugh Aguilar wrote:

    Hugh. How much energy and clock speed were you achieving on the PLD designs?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)