Many search engines nowadays come up with an AI generated preface summing up the results before showing the hits.

Of course we are not a search engine nor a code writing service, but a community tool helping others becoming better programmers.

I initially said it's a horrible idea, bc the way harangzsolt is proposing would lead to too many problems, (apart from implementation problems)

But let's try:

So I took the liberty to feed a current question into Duck.AI using ChatGPT 4o

> Why is "any" slow in this case?

Answer:

It reads interesting - like always with AI - but requires deeper analysis for disguised non-sense. (Disclaimer: I didn't)

Definitely nothing an amateur could handle. But an expert can draw inspiration from this.

For instance I was intrigued by the idea of $1 being slow because it can't optimize numification.(point 2)

So I asked for clarification, guessing this being about dual-values.

> why is numification of read-only slower

Answer:

Again interesting, but I'm not convinced. The claim (Point 2) that "read-only variables do not benefit from caching" can't be reproduced. Because $1 is indeed also a dual-value.

MY CONCLUSION (so far):

LLM output can inspire good ideas in our context but require an expert to deal with. The wordy answers are often full of hidden pitfalls and contrary to a human being the LLM doesn't even try to cross-check what it (hear-)says.

So

• Is there is a meaningful way to integrate an LLM into our question/answer process?

  I don't know. But using normal questions as prompts is obviously a horrible idea.

• But can we stop amateurs posting AI generated texts here, in order to pose as an expert?

  Hardly. This is most likely already happening, at least with AnoMonk posts.

• Will we be forced to increasingly deal with AI here?

  Very likely, at least in requiring us to increase the quality standards of answers or demanding POCs.

IN HINDSIGHT

This should probably better be a meditation in it's own thread.

Disclaimer

This test is far from methodical. I ran this conversation with Duck.AI after the original question already got many answers. Hence the replies might have already been training and influencing the LLM.

The performance drop in "ugly" compared to "ugly_cr" can be attributed to the fact that `$1` and `$2` are read-only and are re-evaluated each time they are used in a comparison. This means that every time you check `$1` or `$2`, Perl has to numify them again, which adds overhead. In contrast, "ugly_cr" assigns these values to lexicals, which are faster to access.

Perl does have to numify them again, but not for the reason given.

no warnings qw( void );

use Devel::Peek qw( Dump );

"a" =~ /(.)/s or die;

0+$1;        # Fetch and numify
Dump($1);
my $x = $1;  # Fetch
Dump($1);
[download]

...
  FLAGS = (GMG,SMG,POK,pIOK,pNOK,pPOK)
...
  FLAGS = (GMG,SMG,POK,pPOK)
...
[download]

As you can see, $1 gets numified. But every time you read from it, it gets repopulated since it's a magic variable. This wipes the previous values.

In the context of analyzing the AI's answer, it's worth noting that I missed the repeated numification in my answer. I stopped too soon.

The "any_cr" method is slower than "any" because of the additional overhead of assigning values to lexicals before performing the checks.

That can't be true since ugly_cr is way faster than ugly. The actual culprit is the overhead from the addition of capturing.

In the context of analyzing the AI's answer, it's worth noting the response is self-contradicting. According to the AI, assigning to the lexicals makes the cr version faster by only doing numification once, but it makes the cr version slower because of the addition of an assignment.

In the example I've shown, the IV slot is set after the first numification.

In fact it doesn't look to me like repeated numification (or magic fetching) was happening.

:~$ perl -MDevel::Peek -E'"42"=~/(\d+)/; say $1; Dump $1; $a=$1+1; Dum
+p $1; say $1; Dump $1' 2>&1 |grep IV
  IV = 0
  IV = 42
  IV = 42
:~$
[download]

Edit

hm ... probably the IV values don't matter if the appropriate I flags aren't set.

~$ perl -MDevel::Peek -E'"42"=~/(\d+)/; say $1; Dump $1; $a=$1+1; Dump
+ $1; say $1; Dump $1' 2>&1 |grep FLAGS
  FLAGS = (GMG,SMG,POK,pPOK)
  FLAGS = (GMG,SMG,IOK,POK,pIOK,pPOK)
  FLAGS = (GMG,SMG,POK,pPOK)
[download]

Cheers Rolf
_{(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery}