Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Who's a thief?

by jeorgen (Pilgrim)
on Jul 02, 2002 at 11:30 UTC ( #178824=note: print w/ replies, xml ) Need Help??

in reply to Who's a thief?
in thread Artificial Intelligence Programming in Perl

Ovid says:

My point, which I alluded to in the first paragraph, is that some languages are better suited for some problems than others. AI, I suspect, is not Perl's strong suit.

Backtracking is an important feature of languages like Prolog and CLIPS. There is also a text-processing language called Icon that uses something called generators.

I wonder if perl's pattern matching could be put to use for AI purposes?


Comment on Re: Who's a thief?
Replies are listed 'Best First'.
Re: Re: Who's a thief?
by pjf (Curate) on Jul 05, 2002 at 10:39 UTC
    My goodness. It's a common enough occurance for someone to point to a Perl regexp and say something like "EEEeeeewww!!!". I don't want to imagine what people will say once they see the regexps used to implement backtracking in AI.

    Paul Fenwick
    Perl Training Australia

      Actually, the only natural backtracking mechanism found in Perl is in regular expressions. Backtracking is what I use to determine primeness of numbers using regular expressions, it's what's used in the Cookbook when regular expressions are used to solve Diophantine equations, and its used in my reduction of 3-CNF-SAT to regular expressions


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://178824]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2015-10-04 22:13 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (105 votes), past polls