Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Who's a thief? -- Quantum::Superpositions

by sleepingsquirrel (Hermit)
on Jan 15, 2005 at 17:19 UTC ( #422527=note: print w/replies, xml ) Need Help??

in reply to Who's a thief? -- the follow up

In short, to fully enjoy the First Order Predicate Calculus in pure Perl involves writing an NFA regex engine that operates on data structures instead of strings.
If you don't want to roll your own non-deterministic operators, you might want to use the ones provided by Quantum::Superpositions. Using that module would probably go a long way towards making your problem much more straight forward.

-- All code is 100% tested and functional unless otherwise noted.
  • Comment on Re: Who's a thief? -- Quantum::Superpositions

Replies are listed 'Best First'.
Re^2: Who's a thief? -- Quantum::Superpositions
by Aristotle (Chancellor) on Jan 17, 2005 at 22:03 UTC

    Then again, it would also add another whole new level of sluggishness. Q::SP is nice, but it's also much slower than situation specific hand rolled solutions. :-/ So long as both your problem and the number of times it is solved are small, Q::SP is lovely, but it doesn't scale well at all.

    Makeshifts last the longest.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2019-10-16 05:30 GMT
Find Nodes?
    Voting Booth?